Erdős Problem #222
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, squares.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
List the positive integers representable as a sum of two nonnegative integer squares:
Erdős asks for good upper and lower bounds on the consecutive gaps \(s_{i+1}-s_i\). Both the maximum size of gaps along an infinite sequence and their growth as a function of \(s_i\) matter.
Allowing zero as one of the two summands is the standard convention: a perfect square counts as a sum of two squares. Requiring both summands positive would change the sequence and its gap structure.
A small example
The first positive sums of two squares are \(1,2,4,5,8,9,10,13,16,17,\ldots\). The gap from \(10\) to \(13\) equals three: the intervening integers \(11\) and \(12\) are not sums of two squares. A candidate gap is certified only after checking every intervening integer.
Fermat's two-square criterion says that an integer is a sum of two squares exactly when each prime congruent to three modulo four occurs with even exponent in its prime factorization. This yields an independent arithmetic checker for finite gap calculations.
What is known
The optimal gap bounds remain OPEN. Bambah and Chowla (1947) proved the upper estimate
Erdős (1951) established infinitely large gaps of size at least a constant multiple of \(\log s_i/\sqrt{\log\log s_i}\). Richards (1982) improved the lower construction to
Subsequent work, most recently attributed in the maintained catalogue to Dietmann, Elsholtz, Kalmynin, Konyagin and Maynard (2022), increases the logarithmic lower constant to about \(0.868\). A logarithmic lower bound and an upper bound by the fourth root leave a substantial asymptotic gap. The average density of sums of two squares does not determine their maximal consecutive gaps.
GCL's current state
Pinned and maintained Erdős #222 classify the optimal bounds OPEN. Original issue #1491. The historical source estimates are not independent GCL proofs; no matched frozen formal statement is present.
The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.
What remains
A bounded task enumerates all sums of squares through \(N=100000\), sorts them, and computes exact consecutive gaps with witnesses. Acceptance: the first terms agree with those above, the missing integers between every selected gap are verified by a second prime-factorization test, and ratios to \(\log N\) and \(N^{1/4}\) are presented as finite diagnostics, not limiting conclusions.
Sources and claim boundaries
- Erdős #222, Bambah–Chowla 1947, Erdős 1951, Richards 1982 and DEKKM 2022.
- GCL original issue #1491.
No new gap exponent, independently reproduced primary proof or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1491 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.