Erdős Problem #726
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (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
For each positive integer n, sum 1/p over primes p≤n for which the least nonnegative remainder r=n mod p lies STRICTLY between p/2 and p. Erdős–Graham–Ruzsa–Straus conjecture this sum is asymptotic to (1/2) loglog n for EVERY sufficiently large n, as n→∞, not merely on average. The maintained source is OPEN. The indicator has to respect strict endpoint p/2<r<p.
A small example
At n=10, prime p=2 has remainder 0 and contributes zero; p=3 remainder 1≤1.5 zero; p=5 remainder 0 zero; p=7 remainder 3≤3.5 zero, so the sum is 0. At n=11, p=2 remainder 1 equals p/2, so it STILL contributes zero, but p=3 remainder 2>1.5 contributes 1/3; p=5 remainder 1 contributes zero; p=7 remainder 4>3.5 contributes 1/7; p=11 remainder 0. Thus the sum is 10/21. Small n are not asymptotic evidence.
What is known
For ODD prime p, the indicator equals floor(2n/p)−2 floor(n/p) since p/2 is half-integer and cannot equal integer r. For p=2 the floor difference is 1 when n odd, even though strict r>1 is impossible; hence the unrestricted floor identity popular in the source forum needs a p=2 correction of 1_{n odd}, a bounded O(1) term. The pinned FC #726.lean correctly encodes strict p/2< n mod p and has answer(sorry) and by sorry. Mertens' theorem says Σ_{p≤n}1/p∼loglog n, motivating the factor 1/2 but giving no control on the residue restriction for each n. Historical EGRS75 primary proof pages not inspected.
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: p2 floor identity strict endpoint exception; uniform prime weighted asymptotic open; pinned fc sorry. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
ERDOS-726-RESIDUE_FLOOR_IDENTITY. Prove exact identity sum over odd primes of (floor(2n/p)−2floor(n/p))/p equals the restricted sum; quantify exceptional p=2 correction for n odd. Compute exact n=10,11,15 fixtures and then attempt one averaged second-moment estimate with hypotheses. Acceptance: exact floor identity and source-faithful asymptotic status, not a new all-n theorem.
Sources and claim boundaries
Maintained Erdős #726; authenticated original source return; GCL-pinned formal statement. Original historical proof pages and external Lean environment uninspected. source-qualified editorial review recorded.
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1997 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- 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.