Erdős Problem #269 — Irrationality of reciprocal lcm sums of smooth numbers
For a finite set of primes with , let the -smooth positive integers be listed in increasing order as , where an integer is -smooth if all its prime divisors belong to ; in particular, is included. For each , let denote the least common multiple of the first terms, and set
Is irrational for every finite prime set with ? The summands are indexed by all smooth integers, so a running least common multiple that remains unchanged across several successive indices contributes repeatedly. Bloom, Erdős Problem #269 (2026)
Background
Erdős posed the question in a letter written on 1 January 1973 and published in the 1974 Fibonacci Quarterly. He described irrationality of the repeated-summand series as a conjecture he could not prove, while saying he could prove irrationality after duplicate summands were removed—that is, for the sum over distinct running least common multiples. This distinction matters: the latter sum is not the series asked about here. Bloom, Erdős Problem #269 (2026)
The 1980 problem collection of Erdős and Graham asks about the finite-prime case, and in a 1988 survey Erdős called the corresponding result for an infinite set of primes a “simple exercise,” adding that it probably extends to finitely many primes greater than one. That infinite-prime assertion concerns a different support condition and does not settle the finite-set question. Will Cook, Running least common multiples: distinct values and multiplicities (2026 preprint) Erdős, On the irrationality of certain series (1988)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.