Erdős–Kac theorem
Source: github.com/HeRunming/erdos-kac-lean/tree/60a2004452b6610ea6…
A complete formalisation, in Lean 4 with Mathlib, of the Erdős–Kac theorem: the number of distinct prime factors ω(n), centred by log log N and scaled by sqrt(log log N), satisfies a central limit theorem on {1, …, N}. The proof goes through Mertens' second theorem and a truncated sieve whose moments are compared with an independent-prime model. Moment comparison is carried over to characteristic functions by a Taylor truncation of exp(iτs), whose remainder is controlled by a uniform even-moment bound; the model characteristic function converges to the Gaussian, and Lévy's continuity theorem…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-20-000016
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-20-000016/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-11-20-000016/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'