Skip to content

Erdős Problem #709

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 distinct positive integers a_i≥2, let M=max a_i. In EVERY block I of f(n)M consecutive integers, can we choose n DISTINCT representatives x_i∈I with a_i|x_i, each a_i matched to its own x_i? Erdős–Surányi ask for good upper and lower growth bounds on the smallest such f(n). The main sharp-order question is OPEN. It differs from #708, which only asks for product divisibility.

A small example

For n=1, any a consecutive integers contain a multiple of a, so f(1)=1. More generally an interval of nM consecutive integers contains at least floor(nM/a_i)≥n multiples of each a_i because a_i≤M. Assign x_1,...,x_n greedily; at step i fewer than n previously selected values are excluded, so some unused multiple of a_i remains. Thus the elementary universal bound is f(n)≤n. This exact argument does not attain the much sharper known O(√n) bound.

What is known

The maintained problem attributes (log n)^c≪f(n)≪n^(1/2) to Erdős–Surányi [ErSu59]. Its March 2026 revision attributes the improved lower f(n)≫log n/loglog n to van Doorn [vD26], through the offset-sensitive #711. Hall's marriage theorem gives a necessary and sufficient finite matching criterion: for each subcollection S of indices, the union of their allowable multiples in I must contain at least |S| integers. A bound only on total multiplicity is insufficient. Complete primary authors' papers [ErSu59] and [vD26] not independently 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: matching distinct representatives not 708 product only; hall union condition required; sharp order open. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Write a Hall-matching lemma for a structured family of divisors, prove the elementary f(n)≤n bound with correct nM endpoints, then compare van Doorn's transfer from #711. Identify the exact source theorem and quantifiers before declaring improved asymptotics certified.

Sources and claim boundaries

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: #1980 — 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.

Back to catalogue · Compendium introduction