2019/12/25 by Hung Viet Chu, Chu, Hung Viet
Mathematics · #11B25 #FOS: Mathematics #Number Theory (math.NT) #math.NT #msc:11B25
paper · pdf · doi:10.48550/arxiv.1912.11587
6 pages
arxiv created 2019/12/25 · arxiv updated 2019/12/30
Iannucci considered the positive divisors of a natural number n that do not exceed the square root of n and found all numbers whose such divisors are in arithmetic progression. Continuing the work, we define large divisors to be divisors at least √(n) and find all numbers whose large divisors are in arithmetic progression. The asymptotic formula for the count of these numbers up to a bound x is observed to be (xloglog x)/(log x).