Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Claim. Let bb and cc be integers with Δ=b2−4c>0\Delta=b^2-4c>0 not a perfect square. Then

∑n≤xd(n2+bn+c)=λ xlog⁡x+O(x),λ=12H∗(Δ)log⁡ϵΔπ2Δ,\sum_{n\le x}d(n^2+bn+c)=\lambda\,x\log x+O(x),\qquad \lambda=\frac{12H^*(\Delta)\log\epsilon_\Delta}{\pi^2\sqrt\Delta},

where dd is the divisor function, H∗(Δ)H^*(\Delta) is a weighted class number and ϵΔ\epsilon_\Delta is the fundamental unit of discriminant Δ\Delta. The zbMATH review of the paper (Zbl 0923.11132) states the theorem as the determination of λ\lambda for Δ>0\Delta>0, completing the case Δ<0\Delta<0 of [[problems/polynomials/E0975/claims/1995_05_01_mckee|McKee's 1995 paper]]; the formula for λ\lambda is as Lapkova (arXiv:1704.02498, (1.3)) restates it. Because the automorphism groups of the forms of positive discriminant are infinite, the paper defines H∗(Δ)H^*(\Delta) through the index of a subgroup of the automorphism group rather than its order; for Δ<0\Delta<0 this agrees with the earlier definition except at Δ=−3\Delta=-3 and −4-4. In the notation of Problem 975, for f(x)=x2+bx+cf(x)=x^2+bx+c with Δ>0\Delta>0 not a square, which is irreducible and positive for all large nn,

∑n≤Xτ(f(n))∼c(f) Xlog⁡X,c(f)=λ>0.\sum_{n\le X}\tau(f(n))\sim c(f)\,X\log X,\qquad c(f)=\lambda>0.

Covers. The monic quadratics x2+bx+cx^2+bx+c with b2−4cb^2-4c positive and not a perfect square. For even bb the polynomial is a translate of x2+ax^2+a with a<0a<0 and −a-a not a square, already covered by Hooley's theorem; the new instances are those with odd bb, such as x2+x−1x^2+x-1. Not covered: the non-monic quadratics of positive discriminant, and every degree three or more, where the problem is open.

Depends on. No page of this wiki.

Acceptance. J. McKee, The average number of divisors of an irreducible quadratic polynomial, Math. Proc. Cambridge Philos. Soc. 126 (1999), no. 1, 17--22, a refereed journal (refereed); the record dates the issue to January 1999 without a day, so the page is dated to the first day of that month. The curator of erdosproblems.com, Thomas Bloom, credits this paper as [Mc99] in the problem's commentary, but the site labels the problem OPEN, so that credit is not acceptance of this partial claim.