Large and small gaps between consecutive Niven numbers.
On a thin set of integers involving the largest prime factor function.
Powerful values of quadratic polynomials.
On the counting function for the Niven numbers
Sur la quantité de nombres économiques
Bounds for the counting function of the Jordan-Pólya numbers
A positive integer is said to be a Jordan-Pólya number if it can be written as a product of factorials. We obtain non-trivial lower and upper bounds for the number of Jordan-Pólya numbers not exceeding a given number .
Page 1