Skip to content

Erdős Problem #848

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: decidable (not automatically the live result).
Subject areas: number theory.

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

The arithmetic condition that every product plus one has a squared prime factor is rigid enough to force one of two residue classes near the optimum. Sawhney's reported stability theorem addresses all sufficiently large N, not an exact statement for every small finite N.

Among A subset [1,N] satisfying ab+1 NOT squarefree for ALL a,b in A, including diagonal, ask whether the maximizing examples are the residue class 7 (mod25); residue 18 (mod25) is symmetric via quadratic roots of -1 modulo25. The theorem concerns all SUFFICIENTLY LARGE N, not every small N. This classification is distinct from problem #844, which forbids squarefree ab without +1.

A small example

Take A={7,32,57}: all ≡7 (mod25), so for every a,b in A including equal terms, ab+1 ≡7²+1≡0 (mod25), not squarefree. If we mix 7 and 18, then 7*18+1=127, prime and squarefree, so the two residues cannot generally be combined. The eventual extremizer may be either full residue class, not just 7.

This finite calculation tests definitions, not a result quantified over all large N or infinite sets.

What is known

Maintained https://www.erdosproblems.com/latex/848 read 2026-10-14 labels DECIDABLE but says problem SOLVED for sufficiently large N by Sawhney, with a note proving: for some c>0, any valid A with |A|>=(1/25-c)N must lie entirely in either residue 7 (mod25) or 18 (mod25). For either residue A, every ab+1 divisible by 25 since 7²+1=50 and 18²+1=325 and both roots satisfy x²=-1 mod25. Published note title/source URL and full stability proof require primary review. Separate van Doorn bound ≈0.108 reduced by Weisenberg to ≈0.105 does not establish exact 1/25.

Both residue classes 7 and 18 modulo 25 solve the necessary local congruence because

$$

7^2+1=50,\qquad18^2+1=325,

$$

both divisible by 25. If all elements of A are in either ONE of those residue classes, every ab+1 is divisible by 25 and hence not squarefree. The classes cannot be freely mixed: \(7\cdot18+1=127\) is squarefree. The source reports an eventual STABILITY theorem putting every sufficiently large near-maximizer within a single class, a much stronger assertion than the earlier numerical density upper bounds. The registry tag DECIDABLE must not obscure this source-reported proof.

GCL's current state

The original authenticated RESULT/1 source return has historical disposition SOURCE_LOCK_READY. This status and the original research exceptions are preserved, not silently converted into a theorem verdict. The maintained Erdős source and source-specific mathematical definitions were reviewed, and this article is editorially reviewed as a source-exception-annotated explanation under EC-BULK-005-R10, effective only after the exact-hash protected admission merges.

Source interpretation and unresolved mathematical qualification: Sawhney-reported eventual stability distinguishes residue 7 and 18 modulo 25 and forbids mixing; complete primary stability proof and source label require review.

The explanation is accepted for publication of established background, examples, and explicitly attributed current claims. It does not establish or formally certify the disputed original theorem, external model-assisted proof, historical interpretation, or any unreplayed Lean kernel file. Original source-fidelity and proof-review research holds remain.

What remains

Exact test all products for A={7,32,57} and mixed {7,18}; verify residue roots modulo25. Obtain Sawhney original proof and its N0/c quantifiers, reconcile registry DECIDABLE with source text SOLVED and avoid overstatement for finite N.

Before acceptance, independently verify source theorem hypotheses and proof fidelity, check displayed mathematics in a deployed browser, and submit a protected editorial admission. No such admission is recorded here.

Sources and claim boundaries

  • Erdős problem #848 and maintained LaTeX/bibliography, read 14 October 2026.
  • Authenticated source-audit return, including mathematical scope and outstanding primary-paper obligations.
  • Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml; external proof claims not independently certified by GCL.
  • Critical review: PENDING. Protected publication: NOT MERGED. Deployed MathJax: NOT VERIFIED. Formal theorem replay: NONE.

Qualified editorial critical review: R10 source-exception dossier. The source-semantic exception is visible and its original research hold remains. Publication classification: REVIEWED EXPLANATORY ARTICLE WITH UNRESOLVED SOURCE/PROOF QUALIFICATIONS. Independent theorem proof or Lean certification: NOT CLAIMED.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2119 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction