OpenAI research collection · 1 manuscript · Source checked 2026-10-19
OpenAI's result summary
Every rational a/b with 1≤ a< b is a sum of O(loglog 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.
Read the manuscripts
Short excerpts below come from OpenAI's abstracts. The full abstract and original PDF preserve the paper's precise scope.
MANUSCRIPT 01
Short Egyptian fractions
We prove a conjecture of Erdős: for every sufficiently large integer b, every rational number a/b with 1≤ a< b is a sum of O(loglog b) distinct positive unit fractions, with an absolute implied constant. This order is best possible when the numerator varies. We also show that both the number of expansions of 1 with exactly k…
Full source abstract
We prove a conjecture of Erdős: for every sufficiently large integer b, every rational number a/b with 1≤ a< b is a sum of O(loglog b) distinct positive unit fractions, with an absolute implied constant. This order is best possible when the numerator varies. We also show that both the number of expansions of 1 with exactly k distinct terms and the least integer at least 2 that never occurs as a denominator in such an expansion grow doubly exponentially in k: their double logarithms have order k.
This PDF is listed in OpenAI's formalization catalogue. See the scope and dependencies before interpreting coverage.
New mathematical reasoning could help AI tackle harder scientific and computational problems. How reliably these skills transfer beyond mathematics will determine how much they contribute to general intelligence.