2000 character limit reached
An information-theoretic proof of the Erdős-Kac theorem
Published 28 Jan 2022 in cs.IT and math.IT | (2202.11694v3)
Abstract: In this article we show that the Erd\H{o}s-Kac theorem, which informally states that the number of prime divisors of very large integers converges to a normal distribution, has an elegant proof via Algorithmic Information Theory.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.