Add to ORKGThis paper is about the existence of numbers divisible by their iterative digit sum (NDIDS). Three conjectures were proposed, firstly, 9 multiply a NDIDS produces a multiple NDIDS. Secondly, there are no 15 or more consecutive NDIDS in the sequence of positive integers. Lastly, all Niven numbers are also NDIDS but the converse is not true. The detailed composition, properties, sequences and comparison with Niven numbers of NDIDS are discusse
For all n , it is always possible to find at least one sum of n consecutive numbers with an equivale...
summary:Let $\mathbb {N}$ be the set of positive integers and let $s\in \mathbb {N}$. We denote by $...
Divisor functions have attracted the attention of number theorists from Dirichletto the present day....
The digit and iterative digit sums of Palindromic numbers, their primes and squares, repdigit, repu...
As the power of the Fibonacci numbers increases from 1 to the power of 5, the number of terms obtai...
summary:We examine the congruences and iterate the digit sums of integer sequences. We generate recu...
ABSTRACT--- This paper aims at introducing a new constructive approach to solve problems in elementa...
Notation. We denote the sum of the digits of a positive integer n by SD(n). The notation a | b mean...
Having established some properties of sequences generated by summing the digits of squared positive ...
AbstractLet d(n) denote the number of positive integers dividing the positive integer n. We show tha...
Sequences were generated by the digit and iterative digit sums of Sophie Germain and Safe primes an...
This is a simple study of expressions of positive integers as sums of consecutive integers. In the f...
. A positive integer m is said to be practical if every integer n 2 (1; m) is a sum of distinct posi...
The article of record as published may be found at http://dx.doi.org/10.1016/j.jnt.2009.04.003Let g ...
In this paper, we give a new method to test the divisibility of any positive integer by another. Fir...
For all n , it is always possible to find at least one sum of n consecutive numbers with an equivale...
summary:Let $\mathbb {N}$ be the set of positive integers and let $s\in \mathbb {N}$. We denote by $...
Divisor functions have attracted the attention of number theorists from Dirichletto the present day....
The digit and iterative digit sums of Palindromic numbers, their primes and squares, repdigit, repu...
As the power of the Fibonacci numbers increases from 1 to the power of 5, the number of terms obtai...
summary:We examine the congruences and iterate the digit sums of integer sequences. We generate recu...
ABSTRACT--- This paper aims at introducing a new constructive approach to solve problems in elementa...
Notation. We denote the sum of the digits of a positive integer n by SD(n). The notation a | b mean...
Having established some properties of sequences generated by summing the digits of squared positive ...
AbstractLet d(n) denote the number of positive integers dividing the positive integer n. We show tha...
Sequences were generated by the digit and iterative digit sums of Sophie Germain and Safe primes an...
This is a simple study of expressions of positive integers as sums of consecutive integers. In the f...
. A positive integer m is said to be practical if every integer n 2 (1; m) is a sum of distinct posi...
The article of record as published may be found at http://dx.doi.org/10.1016/j.jnt.2009.04.003Let g ...
In this paper, we give a new method to test the divisibility of any positive integer by another. Fir...
For all n , it is always possible to find at least one sum of n consecutive numbers with an equivale...
summary:Let $\mathbb {N}$ be the set of positive integers and let $s\in \mathbb {N}$. We denote by $...
Divisor functions have attracted the attention of number theorists from Dirichletto the present day....