Erdős Problem #283 — Egyptian fractions with prescribed polynomial sums
Let be a polynomial whose leading coefficient is positive and such that there exists no with for all . Is it true that, for all sufficiently large , there exist integers such that and
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Special cases are known, but the full conjecture remains unverified despite a reported proof by GPT-5.5 Pro.
The conjecture asks whether every sufficiently large integer can be represented by polynomial values at distinct positive integers whose reciprocals sum to . It is recorded as Erdős Problem ; the retrieved sources do not give a posing date.
Known results
- Graham proved the linear case , in a stronger form for every positive rational reciprocal sum and lower bound.
- Cassels proved that the polynomial hypotheses suffice without the reciprocal-sum constraint.
- Burr proved a power-polynomial variant when repeated indices are allowed.
- Alekseyev proved for every ; van Doorn proved many linear and quadratic cases, including and .
Undated GPT-5.5 Pro proof claim
A discussion reports that GPT-5.5 Pro, prompted by Price, produced a proof of the stronger statement with replaced by any rational . This remains an AI-generated claim: no retrieved preprint or independently verified proof corroborates it.
Current status (as of March 2026): Special cases are established, but the full conjecture has no verified proof; the reported GPT-5.5 Pro proof remains unconfirmed.
Solutions 0
No solutions have been posted yet.