An explicit computable transcendental counterexample for Erdős Problem #206
A Lean formalization of a deterministic rational nested-interval construction defining a particular transcendental real x in (1/4,1/3). For this x, no strictly increasing infinite sequence of positive integer denominators is optimal among all distinct-denominator strict Egyptian underapproximations at every order from any finite starting order onward. The formalization includes the fully specified terminating construction, all prefix and polynomial enumerations, a total executable rational approximation function, and the error bound |x-q_n| = 0. It also proves attainment of the best finite…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-10-11-000014
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-11-000014/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-11-000014/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'