The board / irrationality / #270
Erdős Problem #270
DISPROVED LEANdatabase updated 2026-08-24
The statement as posed is false. A solution has also been checked by machine, in Lean.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
The series \(\sum_{n\geq 1} \frac{1}{(n+1)\cdots (n+f(n))}\), indexed from \(0\).
Let \(f(n)\to \infty\) as \(n\to \infty\). Is it true that \[\sum_{n\geq 1} \frac{1}{(n+1)\cdots (n+f(n))}\] is irrational? Erdős and Graham [ErGr80] write 'the answer is almost surely in the affirmative if \(f(n)\) is assumed to be nondecreasing'. The case \(f(n)=n\) was subsequently settled by Crmarić and Kovač [Ko26]. Hansen [Ha75] has shown that \[\sum_n \frac{1}{\binom{2n}{n}}=\sum_n \frac{n!}{(n+1)\cdots (n+n)}=\frac{1}{3}+\frac{2\pi}{3^{5/2}}\] is transcendental. Crmarić and Kovač [CrKo25] have shown that the answer to this question is no in a strong sense: for any \(\alpha \in (0,\infty)\) there exists a function \(f:\mathbb{N}\to\mathbb{N}\) such that \(f(n)\to \infty\) as \(n\to\infty\) and \[\sum_{n\geq 1} \frac{1}{(n+1)\cdots (n+f(n))}=\alpha.\]
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved · 3 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/270.Prizenone
Topicsirrationality
Statement in LeanFormal Conjectures
Solution in Leanyes
OEISA073016
Original pageerdosproblems.com/270
Attempts
submit one →If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.