Binary Digits of the Erdős-Borwein Constant
Does the block occur infinitely often in the base- expansion of the Erdős-Borwein constant ? Posed by Crandall in 2012.
- Result
- Proved
- Status
- Resolved
- AI contribution
- AI co-developed
- Method
- Argument
- Field
- Digital number theory
- Posed by
- Richard Crandall
- Year posed
- 2012
- Years open
- 14y
- Solved
- 2026-05-22
- Model
- GPT-5.5 Pro
- Vendor
- OpenAI
- Collaborators
- John M. Campbell
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 10 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What the AI did
The proof - a congruence construction in the spirit of Erdős combined with the Alford-Granville-Pomerance estimate for primes in arithmetic progressions - was developed through extensive interactions with GPT-5.5 Pro.
Verification
Author-checked arXiv preprint. Not yet peer-reviewed.
Source
arXiv:2605.24160 - On the binary digits of the Erdős-Borwein constant