Problems/Erdos-Kac Theorem

Erdos-Kac Theorem

Number TheorySOLVED
Year
1940
Difficulty
*****
Solved by
Paul Erdos & Mark Kac (1940)

Statement

The number of distinct prime factors of n is approximately normally distributed.

ω(n)−ln⁡ln⁡nln⁡ln⁡n→dN(0,1)\frac{\omega(n) - \ln\ln n}{\sqrt{\ln\ln n}} \xrightarrow{d} \mathcal{N}(0,1)

About this Problem

The "fundamental theorem of probabilistic number theory." Prime factorization has a deep Gaussian connection.

About the Lean 4 Prover

Lean 4 is a theorem prover and programming language. When a proof compiles in Lean, it is mathematically certain to be correct — the type checker verifies every logical step. This is the gold standard for formal verification.

Our platform uses fal.ai serverless compute to run Lean verification, and Gemini to generate proof strategies that are then formally checked. ShinkaEvolve provides the evolutionary backbone for automated mathematical discovery.

Mathematical Art

Generate a unique AI illustration of this problem using fal.ai FLUX.

Connected Constellations