Abstract:In a landmark paper on arithmetical properties of Lambert series, Erdős proved that $\sum_{n=1}^{\infty} \frac{1}{2^{n} - 1}$ is irrational. This value $E$ is now referred to as the Erdős-Borwein constant. Crandall, in 2012, studied properties of the base-2 expansion of this constant, and left the following as an open problem: Does the string $11$ occur infinitely often in the base-2 expansion of $E$? This open problem was also subsequently noted by Shallit. We succeed in introducing a full proof that solves Crandall's problem in the affirmative. Our proof combines a congruence construction in the spirit of Erdős and an estimate due to Alford, Granville, and Pomerance for the counting function for primes in arithmetic progressions. Our argument was developed through extensive interactions with GPT-5.5 Pro.
| Comments: | Submitted for publication |
| Subjects: | Number Theory (math.NT) |
| MSC classes: | 11A63, 11A25 |
| Cite as: | arXiv:2605.24160 [math.NT] |
| (or arXiv:2605.24160v1 [math.NT] for this version) | |
| https://doi.org/10.48550/arXiv.2605.24160 arXiv-issued DOI via DataCite (pending registration) |
From: John Campbell [view email]
[v1]
Fri, 22 May 2026 19:29:46 UTC (15 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。