An information-theoretic proof of the Erdős-Kac theorem
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912371364069376 |
|---|---|
| author | Rocke, Aidan |
| author_facet | Rocke, Aidan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2202_11694 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | An information-theoretic proof of the Erdős-Kac theorem Rocke, Aidan Information Theory 11N05 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. |
| title | An information-theoretic proof of the Erdős-Kac theorem |
| topic | Information Theory 11N05 |
| url | https://arxiv.org/abs/2202.11694 |