Karatsuba's divisor problem and related questions
Abstract
We prove that Σp ≤ x 1τ(p-1) x( x)3/2, Σn ≤ x 1τ(n2+1) x( x)1/2, where τ(n)=Σd|n1 is the number of divisors of n, and the summation in the first sum is over primes.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.