Skip to content

Erdős Problem #700

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, binomial coefficients.

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 f(n) be the smallest value of gcd(n,C(n,k)) for integers k with 2≤k≤n/2. Erdős and Szekeres ask three different questions about this function in Problem #700: when f(n)=n/P(n) for composite n; whether infinitely many composite n have f(n)>sqrt(n); and whether f(n) enjoys savings beyond every fixed power of log n. Here P(n) is the largest prime factor of n. All three remain OPEN.

A small example

For n=30, exact binomial gcd arithmetic gives f(30)=6, achieved at k=5, and 30/P(30)=30/5=6. For n=25, f(25)=5, which is exactly sqrt(25), not STRICTLY greater. At n=12, the minimum is f(12)=3, reached at k=4. These exact finite values cannot resolve infinitude or universal asymptotic bounds.

What is known

The maintained source credits Erdős and Szekeres with elementary f(n)≤n/P(n) for composite n, f(p^a)=p for prime powers a≥2 and f(pq)=p when p<q are distinct primes. Prime squares therefore satisfy f(p²)=sqrt(p²), meeting a NONSTRICT bound but not the second conjecture's strict inequality. The pinned #700 Lean file includes separate main statements with unresolved answer and proof placeholders. Its auxiliary special-case lemmas require actual environment replay before certification.

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: three distinct open parts; prime square equality not strict gt; pinned main fc sorry. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

The bounded next mathematical task is an exact prime-adic proof of the prime-power and semiprime special cases, with historic ErSz78 page review. Preserve the difference between strict >sqrt(n), equality and the much stronger all-A upper bound. Critical source review, protected merge, deployed mathematical rendering and V2 admission remain outstanding.

Sources and claim boundaries

Maintained #700; pinned Formal Conjectures #700; authenticated GCL return. Original [ErSz78] proof pages uninspected; no new result, kernel replay, protected merge 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: #1971 — 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.

Back to catalogue · Compendium introduction