Erdős problem 859: a refutation of the logarithmic density law

Primarily AI-generated textHuman understanding: no partsmath.NT — Number Theory

Contributed by Liam Kruer ↗, Jensen Kohlmeyer

Version 1 / Nov 21, 2026 / CC BY 4.0

Abstract

Let dtd_t be the natural density of integers nn for which tt is a sum of distinct positive divisors of nn. We prove lim inf⁡t→∞(−log⁡dt)/log⁡log⁡t=δ\liminf_{t\to\infty}(-\log d_t)/\log\log t=\delta and (log⁡t)δdt→0(\log t)^\delta d_t\to0, where δ=1−(1+log⁡log⁡2)/log⁡2\delta=1-(1+\log\log2)/\log2. Together these exclude every pure logarithmic power asymptotic with a positive leading coefficient. This exposition gives the exact finite prime model and the density and change-of-measure reductions. It explains the divisor-interval saving and the arithmetic construction and links to the complete formal proof.

Author comments: TeX edition of the expanded Conjectures.io exposition linked from Justin Sun Prize submission JSP-000712. Original expanded PDF: https://conjectures.io/papers/erdos859.pdf?v=20260921-expanded . Accepted Lean source and verification: https://conjectures.io/results/e060355f-a728-4b06-af11-6302b5780d19

Provenance statement

The expanded exposition was prepared with Codex assistance from the authors’ manuscript and the accepted Lean submission. The prose explains the published formal proof and links both the accepted proof and the authors’ more detailed working manuscript.

References

  1. P. Erdős, Some extremal problems in combinatorial number theory (1970), pp. 123--133. The question is on p. 130, equation (33).
  2. Erdős Problems, Problem 859 , https://www.erdosproblems.com/859.link
  3. L. Kruer and J. Kohlmeyer, Divisor sums and a counterexample to Erdős problem 859 (https://github.com/JENW1N/complete-math-solutions/blob/a624e9de77e0bd8868e7103f8b379f9dbd86b607/papers/erdos859-divisor-sums.pdf), author-supplied working manuscript, 18 September 2026, 27 pp., especially Sections 2--5.link
  4. JenW1N, Erdős 859 counterexample submission, Conjectures, accepted 18 September 2026. Public result and review (https://conjectures.io/results/e060355f-a728-4b06-af11-6302b5780d19) and archived accepted proof body (https://github.com/JENW1N/complete-math-solutions/blob/a624e9de77e0bd8868e7103f8b379f9dbd86b607/accepted/erdos859.lean).link
  5. K. Ford, https://www.ford126.web.illinois.edu/wwwpapers/hxy2y_2012.pdf Integers with a divisor in (y,2y](y,2y] , version dated 13 March 2013.link
  6. PNT+ contributors, PrimeNumberTheoremAnd, Mertens development. The version used is a5154676af9aa3095150ee410cdda80555aa0642 .

Version history

  1. v1 · 11 pagesSubmitted by Liam KruerTeX edition of the expanded Conjectures.io exposition linked from Justin Sun Prize submission JSP-000712. Original expanded PDF: https://conjectures.io/papers/erdos859.pdf?v=20260921-expanded . Accepted Lean source and verification: https://conjectures.io/results/e060355f-a728-4b06-af11-6302b5780d19CurrentNov 21, 2026