Erdős Problem #824 under a smooth shifted-prime hypothesis
A Lean formalization of the conditional lower bound for the number h(x) of pairs of coprime positive integers a 0 and all sufficiently large natural x. The argument adapts Pollack and Pomerance's finite counting method. A⁺ itself, the squarefree strengthening, and the accompanying paper's argument relying on the WD preprint are not formalized here.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-10-11-000021
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-11-000021/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-000021/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'