Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Let and be integers with not a perfect square. Then
where is the divisor function, is a weighted class number and is the fundamental unit of discriminant . The zbMATH review of the paper (Zbl 0923.11132) states the theorem as the determination of for , completing the case of [[problems/polynomials/E0975/claims/1995_05_01_mckee|McKee's 1995 paper]]; the formula for 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 through the index of a subgroup of the automorphism group rather than its order; for this agrees with the earlier definition except at and . In the notation of Problem 975, for with not a square, which is irreducible and positive for all large ,
Covers. The monic quadratics with positive and not a perfect square. For even the polynomial is a translate of with and not a square, already covered by Hooley's theorem; the new instances are those with odd , such as . 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.