Erdős Problem #69
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: number theory, irrationality.
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 \(\omega(n)\) count the distinct prime factors of \(n\). For instance, \(\omega(12)=2\) because \(12=2^2\cdot3\). Erdős asked whether
can equal a fraction of two integers. The denominator makes the sum converge rapidly, but convergence alone says nothing about rationality.
A small example
The first contributions come from \(n=2,3,4,5,6\):
There is a remarkable equivalent form:
Indeed \(\omega(n)=\sum_{p\mid n}1\). Exchanging nonnegative sums and evaluating the geometric series over multiples of each prime gives the identity. This proves the identity, not irrationality.
What is known
The irrationality question is solved. Terence Tao and Joni Teräväinen proved unconditionally that \(S\) is irrational. Their Theorem 1.3 appears in Quantitative correlations and some problems on prime factors of consecutive integers, arXiv:2512.01739v2 (2026), with proof in Section 5. Their argument relies on difficult estimates for multiplicative-function correlations and probabilistic reasoning. Earlier work by Kyle Pratt obtained a conditional result. The classical irrationality theorem for the distinct series involving \(\tau(n)\), the number of divisors, does not settle this question by itself.
GCL's current state
The pinned catalogue and dated live Erdős Problems page both mark #69 as proved. GCL has independently checked the elementary prime-series identity for finite cutoffs, but has not reproduced or certified the full irrationality proof. This is an unaccepted editorial draft associated with source issue ERDOS-CATALOGUE-0069-S01.
The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.
What remains
A bounded exercise is to prove, for every integer \(N\ge2\),
Exact rational checks for all \(2\le N\le100\) passed on CHAD. The infinite identity follows by monotone convergence. Formal certification of the unconditional irrationality theorem would be a separate undertaking.
Sources and claim boundaries
- Tao and Teräväinen, Theorem 1.3 and Section 5: https://arxiv.org/html/2512.01739v2
- Erdős Problems #69: https://www.erdosproblems.com/69
- Original source issue: https://github.com/grandchallenge/MATH-PROGRAMME/issues/1338
The unconditional theorem is credited to its authors. GCL's finite checks are explanatory and do not constitute independent mathematical certification.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1338 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- 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.