Remark: Family 025. Erd (o)s’s short Egyptian-fraction conjecture

Every rational $a/b$ with $1\le a<b$ is a sum of $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.

The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.