In mathematics, Probabilistic number theory is a subfield of number theory, which explicitly uses probability to answer questions about the integers and integer-valued functions. One basic idea underlying it is that different prime numbers are, in some serious sense, like independent random variables. This however is not an idea that has a unique useful formal expression.
The founders of the theory were Paul Erdős, Aurel Wintner and Mark Kac during the 1930s, one of the periods of investigation in analytic number theory. Foundational results include the Erdős–Wintner theorem and the Erdős–Kac theorem on additive functions.
YouTube Encyclopedic
-
1/3Views:84 8772 82525 555
-
3. Probability Theory
-
Extremal and Probabilistic Combinatorics Aula 1 Parte 1
-
Randomized algorithms (intro) | Journey into cryptography | Computer Science | Khan Academy
Transcription
See also
- Number theory
- Analytic number theory
- Areas of mathematics
- List of number theory topics
- List of probability topics
- Probabilistic method
- Probable prime
References
- Tenenbaum, Gérald (1995). Introduction to Analytic and Probabilistic Number Theory. Cambridge studies in advanced mathematics. Vol. 46. Cambridge University Press. ISBN 0-521-41261-7. Zbl 0831.11001.
Further reading
- Kubilius, J. (1964) [1962]. Probabilistic methods in the theory of numbers. Translations of mathematical monographs. Vol. 11. Providence, RI: American Mathematical Society. ISBN 0-8218-1561-X. Zbl 0133.30203.
 | This number theory-related article is a stub. You can help Wikipedia by expanding it. |
This page was last edited on 4 October 2023, at 22:03