Erdős Problem #770
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 n≥1 define h(n) as the smallest h≥2 such that gcd(2^n−1,3^n−1,...,h^n−1)=1. The maintained text calls these numbers 'mutually coprime', but this must mean their COMBINED gcd is one, not PAIRWISE gcd one. Under pairwise interpretation the stated elementary property h(n)=n+1 iff n+1 prime fails. The source asks whether the density of {n:h(n)=p} exists for each prime p, whether liminf h(n)=∞, and a prime-divisor criterion involving p>n^ε; these remain OPEN.
A small example
Take n=4: 2⁴−1=15, 3⁴−1=80, 4⁴−1=255 all divisible by 5, but 5⁴−1=624 is coprime to 5. The overall gcd of 15,80,255,624 is 1, so h(4)=5, matching n+1=5 prime. Yet 15 and 80 share gcd 5, and are NOT pairwise coprime. This exact n=4 calculation exposes the semantic necessity of collective gcd. For n=2, gcd(3,8)=1, so h(2)=3.
What is known
The maintained catalogue asserts h(n)=n+1 iff n+1 is prime and h(n) unbounded along odd n; it also conjectures h(n)=3 for infinitely many n. The site's literal word 'minimal ... mutually coprime' might be misread as pairwise-coprime, which would make the minimal h=2 trivial for one term or fail the n=4 prime characterization. The source-consistent collective-gcd formulation is mathematically nontrivial; its infinite density claims are not resolved. Historic [Er74b] primary passage and exact treatment of h(n) for all n need direct source fidelity review.
GCL's current state
The original authenticated RESULT/1 source return has historical disposition STATUS_CONFLICT. 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: A pairwise-coprime reading trivializes the source's h(n); collective gcd interpretation and the original Erdos primary passage need locking.
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
ERDOS-770-GCD-SEMANTIC-LOCK. Inspect Er74b original formula for gcd(2^n−1,...,h^n−1)=1 versus pairwise coprimality. Prove h(4)=5 and h(2)=3 and enumerate h(n) for n≤40 under collective gcd and contrast with pairwise criterion. Only then formalize prime p level-set densities and the liminf question. Admission HOLD pending original primary semantic lock.
Sources and claim boundaries
Maintained Erdős #770; authenticated GCL source return. Full original primary proofs and deployed browser MathJax review pending. the exact-hash explanatory admission is R10.
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: #2041 — 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.