Short Egyptian Fractions: How OpenAI’s Proof Solved Erdős’s 76-Year-Old Conjecture and Established the Optimal Double-Logarithmic Bound
How many fractions does a fraction really need? For 76 years, a conjecture of Paul Erdős asked whether every rational number below one could be assembled from remarkably few distinct reciprocals. OpenAI’s September 25, 2026 manuscript, Short Egyptian Fractions, presents a proof that the worst-case minimum length grows like the logarithm of the logarithm of … Read more