openmath.dev
Esc

Loading…

↑ ↓ to move↵ to open

Appearance
Appearance

Number theory · Oct 6, 2026

Short Egyptian fractions

Every rational a/ba/b with 1≤a<b1\le a\lt b is a sum of O(log⁡log⁡b)O(\log\log b) distinct positive unit fractions. The worst-case minimum number of terms has the same order, resolving Erdős’s conjecture on short Egyptian fractions.

Contributors

Unreleased OpenAI model

AI systems: Unreleased OpenAI model

Sources