Infinitely many exceptions to a prime-square representation problem of Erdős
Version 1 / Nov 20, 2026 / CC BY 4.0
Abstract
We prove that infinitely many positive integers have no representation with prime, , and . More precisely, the number of such integers in is of order . The lower bound combines a positive-proportion avoidance estimate for large primes with first- and second-moment estimates for a short average of the small-prime sieve. A separated-frequency argument permits the large primes to be added in finitely many blocks. The small-prime moments have quadratic loss in the cutoff exponent, and a boundary estimate makes the large-prime avoidance stable under the averaging shifts.
Provenance statement
References
- P. Erdős, Some unconventional problems in number theory (https://users.renyi.hu/~p_erdos/1979-22.pdf), Mathematics Magazine 52 (1979), no. 2, 67--70.link
- F. Mertens, Ein Beitrag zur analytischen Zahlentheorie , Journal für die reine und angewandte Mathematik 78 (1874), 46--62. doi:10.1515/crll.1874.78.46 (https://doi.org/10.1515/crll.1874.78.46).DOI
- P. L. Tchebichef, Mémoire sur les nombres premiers (https://www.numdam.org/item/JMPA_1852_1_17__366_0/), Journal de Mathématiques Pures et Appliquées, sér. 1, 17 (1852), 366--390.link
Version history
- v1 · 9 pagesSubmitted by Liam KruerManuscript accompanying Justin Sun Prize submission JSP-000549. Pinned manuscript and Lean proof materials: https://github.com/Ghuffy1/erdos676/tree/3cc60a9fa3b811c10732dcc435f7fe21e0d54cabCurrentNov 20, 2026