Erdős Problem #677
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
Can the least common multiple of one block of consecutive integers recur in a completely later block of the same length? Write \(M(n,k)=\mathrm{lcm}(n+1,\ldots,n+k)\). The main Erdős #677 asks whether \(M(n,k)\ne M(m,k)\) whenever \(m\geq n+k\). This is still OPEN. The intervals do not overlap, and the number of terms stays fixed.
A small example
Some different-length blocks do have the same least common multiple: \(M(4,3)=\mathrm{lcm}(5,6,7)=210=M(13,2)\) and \(M(3,4)=\mathrm{lcm}(4,5,6,7)=420=M(19,2)\). These identities, verified by gcd/lcm arithmetic, are not counterexamples because the two blocks have different lengths. Nor does a short-shift decrease, such as \(M(6,7)>M(8,7)\), refute the claim: \(8<6+7\).
What is known
For \(k=1\) the lcm is \(n+1\). For \(k=2\) it is \((n+1)(n+2)\) because consecutive integers are coprime. Both strictly increase with \(n\), proving non-recurrence for those lengths. The maintained source attributes to the Thue–Siegel theorem that for each fixed \(k\) there can be only finitely many separated equalities. Finitely many is weaker than none. A bounded exhaustive scan for \(1\leq k\leq7\), \(0\leq n\leq100\) and \(n+k\leq m\leq150\) found none; this is not an infinite proof. The maintained page also reports a stronger conjecture comparing prime-factor sets of two nonoverlapping products, which is a different statement.
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: open equal length lcm unresolved; published fixed k thue siegel finite not zero; pinned fc main sorry. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
A bounded successor is to prove a prime-valuation restriction for a fixed \(k\), preferably \(3\) or \(4\), whenever two disjoint intervals have equal lcm. A genuine proof must cover every allowed pair of starting points, not only those within a search bound. Editorially, a page-specific original-source review, mathematical critical review, protected merge, deployed mathematics inspection and V2 admission are still required.
Sources and claim boundaries
Maintained #677; pinned Formal Conjectures #677; authenticated GCL source report. Erdős [Er79],[Er79d],[ErGr80] full primary passages not inspected. This is an editorially reviewed draft; no new theorem, proof certificate, production publication, real-browser math check or editorial admission.
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: #1948 — 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.