Skip to content

Erdős Problem #841

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: solved (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 search distance t_n measures how far above n one must go to find integers whose product with n is a square. Its distribution is controlled by the largest prime factor but the two quantities need not be pointwise equal.

For n a positive integer, define t_n least t>=0 for which there is a subset S⊂{n+1,...,n+t} with n·prod(S) a square, with t_n=0 for square n. A classical problem estimates t_n and how often it is nearly n; the 2024 paper solves DISTRIBUTIONAL agreement with largest prime factor P(n), not a pointwise formula for all n.

A small example

For n=6, the selected {8,12}⊂{7,...,12} yields 6·8·12=24², and exhaustive all earlier intervals t<=5 admit no such subset. Therefore t_6=6, whereas largest prime factor P(6)=3. For n=4 square, t_4=0 and P(4)=2, showing why lower t_n>=P(n) needs nonsquare scope. Exact parity-of-prime-exponents certificate fits finite testing.

This finite calculation is not an asymptotic or all-parameter proof.

What is known

Maintained /latex/841 read 2026-10-14: Selfridge proved t_n=P(n) if P(n)>sqrt(2n)+1, and t_n<<sqrt(n) otherwise; Bui–Pratt–Zaharescu [BPZ24], A problem of Erdős-Graham-Granville-Selfridge on integral points on hyperelliptic curves, Math Proc Camb Phil Soc (2024) 309–323, proved equality of limiting distribution fractions for t_n<=n^c versus P(n)<=n^c (0<c<=1), plus bounds on exceptional small t and all nonsquares. Strict t_n>=P(n) applies to nonsquares; squares have t=0 by convention. Their theorem does NOT give pointwise t_n=P(n) always.

A subset product makes \(n\) a square exactly when the parity of every prime exponent in the product becomes even. At \(n=6\), selecting 8 and 12 first becomes possible with \(t=6\), since

\[ 6\cdot8\cdot12=24^2. \]

For square \(n\), the empty subset yields \(t_n=0\). Thus \(t_n\geq P(n)\) requires a non-square restriction. The Bui–Pratt–Zaharescu 2024 theorem equates limiting DISTRIBUTIONS of \(t_n\leq n^c\) and \(P(n)\leq n^c\), not the values for each \(n\).

GCL's current state

The authenticated original RESULT/1 source return records SOURCE_LOCK_READY and preserves its issue-bound mathematical source observations. This explanatory article is REVIEWED under the exact-hash EC-BULK-005-R6 editorial transaction, subject to the protected merge of PR #2676. Its original source-audit status is retained. Editorial acceptance and public MathJax validation do not certify any original research theorem, external Lean file, or complete historical proof.

Unclosed mathematical proof/source qualifications: BPZ2024_DISTRIBUTIONAL_PROOF_NOT_REPLAYED; SQUARE_N_EXCEPTION_T0; POINTWISE_EQUALITY_NOT_CLAIMED.

What remains

Implement GF(2) prime parity-vector subset search for n=4,6,10 and compare largest prime divisor, verify published 2024 distribution theorem quantifiers and distinction from pointwise and lower bound square convention.

For mathematical proof certification, the complete primary argument and any external formalization must undergo separate independent replay. The bounded finite calculation is recorded in the governed R6 fixture; editorial approval does not discharge the outstanding research obligations.

Sources and claim boundaries

  • Maintained Erdős problem #841, LaTeX/bibliography and authenticated issue source return, checked 14 October 2026.
  • Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml. Original papers and unresolved proof obligations are identified in the source comment.
  • Editorial decision: exact-hash reviewed explanatory article, protected R6 transaction. Mathematical theorem proof / external Lean certification: NOT CLAIMED. The original SOURCE_LOCK_READY return, primary-source attribution, and proof-review holds remain.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2112 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • 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.

Back to catalogue · Compendium introduction