An information-theoretic proof of the Erdős-Kac theorem

2022/01/28 by Rocke, Aidan
#11N05 #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2202.11694

Abstract

In this article we show that the Erdő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.

Related

• Generalizations of the Erdős-Kac Theorem and the Prime Number Theorem
• An Erdős-Kac theorem for integers with dense divisors
• A Probabilistic Framework for the Erdos-Kac Theorem
• Théorème d'Erdős-Kac dans un régime de grande déviation pour les translatés d'entiers ayant k facteurs premiers
• An Erdős-Kac theorem for Smooth and Ultra-Smooth integers