Erdős Problem #708
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
Let A be n distinct integers ≥2 and I a block of M=max(A) consecutive nonnegative integers. Erdős–Surányi ask for the smallest uniform g(n) that permits a subset B of I whose product is divisible by the product of all elements of A. The maintained source asks whether g(n)≤(2+o(1))n, perhaps even 2n. It is OPEN. Crucially PRODUCT divisibility is not a matching of each a to a distinct multiple: that is #709.
A small example
For A={2,3} and I={1,2,3}, B={2,3} gives product 6 divisible by product 6. For A={2,3,4}, I={1,2,3,4}, choosing all four gives product 24, again divisible by 24. The maintained source states exact g(2)=2 and g(3)=4, but these two examples alone prove neither universal claim.
What is known
The maintained source attributes g(n)≥(2−o(1))n and g(3)=4 to Erdős–Surányi [ErSu59], using products of pairs of primes for the lower-bound construction. The source also asks a separate variant with exactly n chosen numbers and a stretched interval c_n M, giving c_2=1, c_3=√2. A SOURCE-FIDELITY issue needs primary-paper clarification: if 'subset B with |B|=g(n)' literally requires EXACTLY g(n) selected positions in EVERY interval, it cannot work for instances with M<g(n), whereas an 'at most g(n)' certificate can. Because M≥n+1, an asymptotic g(n)≈2n need not fit in the smallest intervals. Neither a false inconsistency claim nor an implicit switch to at-most is acceptable without historical source lock.
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: Historical exactly-versus-at-most g(n) selectable-cardinality convention is unresolved; a small interval with M<g(n) exposes the distinction.
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
Retrieve Erdős–Surányi 1959 exact statement and distinguish minimum AT-MOST-cardinality versus exact-cardinality quantifier for g(n). Reproduce g(2)=2 and g(3)=4 universal arguments, or identify one missing lemma. Compare the separate stretched interval c_n variant without conflation. No attempt to conclude the (2+o(1))n upper bound from finite examples.
Sources and claim boundaries
Maintained #708 and authenticated issue-bound return. Original [ErSu59], [Er92c], [Er92e] complete papers not independently inspected. no newly certified theorem proof, deployed MathJax readback or V2 admission.
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: #1979 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- 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.