Optimal bounds for the length and number of unit fraction representations
This paper gives a human-written exposition and simplification of proofs that were recently posted by OpenAI. We prove that every $a/b\in (0, 1)$ can be written as the sum of $O(\log\log b)$ many distinct unit fractions. We also prove that the number of representations of $1$ as the sum of $k$ distinct unit fractions grows doubly exponentially in $k$.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2610.00407
curl -X POST /api/v1/records/hexagon/2610.00407/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00407/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'