Erdős 1057 / JSP-000877: mathematical account of the submitted proof
Version 1 / Nov 21, 2026 / CC BY 4.0
Abstract
Let count the Carmichael numbers at most . This account describes the submitted Lean proof of . It identifies the analytic input from Dirichlet -functions, the construction of smooth shifted primes, and the transfer from those primes to sufficiently many Carmichael numbers for every large bound. It links the complete modular and standalone formal proofs and distinguishes their verified exponent-one endpoint from the stronger claims considered in the historical candidate.
Provenance statement
References
No bibliography entries.
Version history
- v1 · 4 pagesSubmitted by Liam KruerTeX edition of the mathematical account accompanying Justin Sun Prize submission JSP-000877. Pinned source and Lean proof materials: https://github.com/JENW1N/erdos1057-lean/tree/fd7bc2cac0e0518406be9eb6f07b29cb5239b0e3CurrentNov 20, 2026