← All problems

Erdős Problem #975 — Average divisor counts of polynomial values

74 years old · traced to

Let f∈Z[x]f\in\mathbb{Z}[x] be irreducible and nonconstant, and suppose there is an integer n0n_0 such that f(n)≥1f(n)\geq 1 for every integer n≥n0n\geq n_0. For a positive integer mm, let τ(m)\tau(m) denote its number of positive divisors. Is there a constant c(f)>0c(f)>0 such that, as X→∞X\to\infty,\n

∑n0≤n≤Xτ(f(n))∼c(f)Xlog⁡X?\sum_{n_0\leq n\leq X}\tau(f(n))\sim c(f)X\log X?

\nChanging the fixed lower cutoff to any other cutoff beyond which f(n)>0f(n)>0 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 Xlog⁡XX\log X, and Erdős [Er52b] proved a matching upper bound. Thus the normalized sum is bounded above and below by positive constants depending on ff; 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

Progress summary

Never refreshed

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.