Erdős Problem #686
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≥2, Erdős asks whether N can always be expressed as the quotient of two products of k consecutive positive integers, with k≥2 and with the upper interval completely later than the lower: N=Π_{i=1}^k(m+i)/Π_{i=1}^k(n+i), m≥n+k. This remains OPEN. Squares are a particularly important case. One cannot silently allow k=1 or overlapping intervals.
A small example
An exact positive witness for N=9 is k=3,n=11,m=25: (26·27·28)/(12·13·14)=19656/2184=9. In contrast, N=4 has NO representation with k=2. Writing x=m+1 and y=n+1, the required equation x(x+1)=4y(y+1) has no integer solution: 2y(2y+1) is too small and (2y+1)(2y+2) too large. This excludes only length two, not all k.
What is known
The pinned google-deepmind/formal-conjectures@85f863718beeec7b58a3a1926ee92e3472bc2020 file FormalConjectures/ErdosProblems/686.lean correctly separates the overall open statement from square, N=4, N=9 and non-square variants. Its N=9 proof gives the preceding numerical witness; its N=4,k=2 exclusion is an actual Lean proof body without sorry. The main theorem, square variant and N=4 all-length question contain sorry. The file also asserts a positive result for nonsquare N, but its very unusual proof body has NOT been compiled or audited in the pinned environment, so that claim is not promoted to protected GCL proof certification. Discussion of Pell-type reductions is source-attributed and not an independent solution. The maintained catalogue remains OPEN.
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: main all n product quotient open; n4 k2 impossibility not all k; pinned fc has sorry and unreplayed partial proofs. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Reproduce the N=4,k=2 obstruction algebraically and confirm the N=9,k=3 witness; next inspect the precise Lean assumptions for the k≥2 and m≥n+k intervals, then evaluate the asserted nonsquare-N proof with a real Lean build, dependency and axiom report. Do not claim the full all-N question is solved or that an uncompiled external branch is a certificate.
Sources and claim boundaries
Sources: maintained Erdős #686; https://www.erdosproblems.com/686 ; https://github.com/google-deepmind/formal-conjectures/blob/85f863718beeec7b58a3a1926ee92e3472bc2020/FormalConjectures/ErdosProblems/686.lean ; original [Er79d] not independently read. GCL original source return. Historical references not independently inspected. No theorem novelty, protected merge, full browser rendering or V2 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: #1957 — 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.