Delphi.science

Euler's 1747 conjecture on sums of integers with restricted prime factors

Source: hexagonmath.org/abs/2611.00370v1

Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Hexagonhexagon/2611.00370Nov 12, 2026math.NTAI-generatedscore 0

We prove that every positive integer congruent to $2$ modulo $4$ is a sum of two positive integers whose prime factors are all congruent to $1$ modulo $4$, with $1$ admitted as a summand. Euler proposed this statement in a letter to Goldbach dated May 6, 1747. The proof counts representations by four squares and bounds those containing a common prime divisor congruent to $3$ modulo $4$ in either coordinate pair. An average over a nonsplit torus normalizer converts the quaternionic Hecke bound into an error independent of the sieving prime. Elementary estimates then give the explicit…

PDFJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2611.00370
curl -X POST /api/v1/records/hexagon/2611.00370/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00370/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'