



























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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。