Erdős Problem #975 — Average divisor counts of polynomial values
Let be irreducible and nonconstant, and suppose there is an integer such that for every integer . For a positive integer , let denote its number of positive divisors. Is there a constant such that, as ,\n
\nChanging the fixed lower cutoff to any other cutoff beyond which does not affect the question. Erdős Problem #975
Background
The problem is recorded as Erdős [Er65b]. Its basic scale was established earlier: van der Corput [Va39] proved a lower bound of order , and Erdős [Er52b] proved a matching upper bound. Thus the normalized sum is bounded above and below by positive constants depending on ; the question asks whether it converges to a specific constant. The quadratic case has a longer history, including work of Scourfield, Hooley, and McKee. In that setting the leading constant can encode arithmetic information about the polynomial, rather than depending only on its degree. Erdős Problem #975 Explicit upper bound for the average number of divisors of irreducible quadratic polynomials
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.