Erdős Problem #685
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, primes, 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
For an integer n and a binomial index k in the middle range n^ε < k ≤ n^(1−ε), Erdős asks whether the number ω(C(n,k)) of DISTINCT prime divisors is asymptotic to k times the sum of reciprocals of primes p strictly between k and n. The asymptotic must be uniform in this specified range once ε>0 is fixed. The even harder version allows k as small as a power of log n. These remain OPEN questions; no assertion about prime factors counted with multiplicity is intended.
A small example
For n=20,k=5, C(20,5)=15504=2^4·3·17·19, so ω(C(20,5))=4. For n=30,k=7, C(30,7)=2035800=2^3·3^3·5^2·13·29, with five distinct prime factors. These are exact arithmetic examples, not a test of the proposed asymptotic because ε, n and the uniformity window must be treated asymptotically.
What is known
For a prime p, Legendre's formula gives v_p(C(n,k))=Σ_{j≥1}(floor(n/p^j)−floor(k/p^j)−floor((n−k)/p^j)). Hence ω(C(n,k)) is exactly the number of primes for which this sum is positive. Kummer's theorem interprets the valuation as the number of base-p carries when k and n−k are added. For p>k with p²>n, there is no higher-power contribution and p divides C(n,k) precisely if the interval n−k+1,…,n crosses a multiple of p. This motivates, but does not prove, a prime-independent heuristic kΣ_{k<p<n}1/p. Higher powers, overlapping divisibilities, and uniformity in both n and k must be controlled. The maintained problem is OPEN; the original [Er79d] source has not been inspected page by page.
GCL's current state
The original authenticated RESULT/1 source return has historical disposition PARTIAL. 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: Legendre/Kummer finite prime valuations do not certify a uniform omega-binomial asymptotic for all k.
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
Select ε=1/4 and prove or refute one uniform bound for the contribution from primes k<p
Sources and claim boundaries
Sources: maintained Erdős #685; https://www.erdosproblems.com/685 ; GCL pinned catalogue teorth/erdosproblems@536408716724a2402bdfa7c1d764bf83d64a8c89, source original #1956; Erdős [Er79d] historical pages not independently inspected. GCL original source return. Historical references not independently inspected. No theorem novelty, protected merge, full browser rendering 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: #1956 — 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.