When the Large Divisors of a Natural Number Are in Arithmetic Progression
From MaRDI portal
Publication:5113814
Abstract: Iannucci considered the positive divisors of a natural number that do not exceed the square root of and found all numbers whose such divisors are in arithmetic progression. Continuing the work, we define large divisors to be divisors at least and find all numbers whose large divisors are in arithmetic progression. The asymptotic formula for the count of these numbers up to a bound is observed to be .
Recommendations
- When the nontrivial, small divisors of a natural number are in arithmetic progression
- When the small divisors of a natural number are in arithmetic progression
- The number of divisors of an integer in arithmetic progressions
- On the distribution of natural numbers with divisors from an arithmetic progression
- Large values of the sum of divisors function in arithmetic progressions
- Divisors of Integers in Arithmetic Progression
- The divisor problem for arithmetic progressions
- The divisor problem for arithmetic progressions
Cites work
Cited in
(3)
This page was built for publication: When the Large Divisors of a Natural Number Are in Arithmetic Progression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113814)