The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions

@article{Erds1940TheGL,
  title={The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions},
  author={Paul Erd{\"o}s and Mark Kac},
  journal={American Journal of Mathematics},
  year={1940},
  volume={62},
  pages={738}
}
The present paper concerns itself with the applications of statistical methods to some number-theoretic problems. Recent inrestigations of Erdiis and Wintrier ? have shown the importance of the notion of statistical independence in number theory ; the purpose of this paper is to emphasize this fact once again. It may be mentioned here that we get as a particular case of our main theorem the following result : If v(m) denotes the number of prime divisors of ~1, and En the number of those… 
Probabilistic Number Theory
The field of probabilistic number theory has its origins in a famous 1917 paper of Hardy and Ramanujan. In that paper, they studied the “normal order” of the arithmetic function ω(n), defined as the
Statistical independence in mathematics–the key to a Gaussian law
In this manuscript we discuss the notion of (statistical) independence embedded in its historical context. We focus in particular on its appearance and role in number theory, concomitantly exploring
PROBABILISTIC NUMBER THEORY
What is probabilistic number theory? In the widest sense, one could say that it coincides more or less with analytic number theory (it is maybe for this reason that certain arithmeticians, lest their
On the size of certain number-theoretic functions
and assume that 73„—► «> with ». Erdös and Kac [7](2) have proved the following theorem: The number of m^nfor which f(m) <An + o)Bn is nD(w)+o(n), as n—»°o. The present paper is concerned with the
An Introduction to Probabilistic Number Theory
TLDR
This book develops probabilistic number theory from scratch, with short appendices summarizing the most important background results from number theory, analysis and probability, making it a readable and incisive introduction to this beautiful area of mathematics.
Limit theorems for B–free integers and the Moebius function
This thesis presents several limit theorems linked by the topic of pseudorandomness of the Möbius function. The Möbius function is supported on the sequence of square–free integers. The distribution
From Probabilistic Diophantine Approximation to Quadratic Fields
The theory of Irregularities of Distribution (the counterpart of Uniform Distribution) was initiated by the classical papers of H. Weyl (1916), Van der Corput (1935), van Aardenne-Ehrenfest (1945),
A probabilistic approach to the Erd\"os-Kac theorem for additive functions
We present a new perspective of assessing the rates of convergence to the Gaussian and Poisson distributions in the Erdös-Kac theorem for additive arithmetic functions ψ of a random integer Jn
The Forties and Fifties
The central events of this period in analytical number theory are the creation of the sieves of Yu.V. Linnik and A. Selberg, a new method of evaluating character sums invented by D.A. Burgess, the
Randomness of Möbius coefficents and brownian motion: growth of the Mertens function and the Riemann Hypothesis
The validity of the Riemann Hypothesis (RH) on the location of the non-trivial zeros of the Riemann ζ-function is directly related to the growth of the Mertens function M(x) = ∑x k=1 μ(k), where μ(k)
...
1
2
3
4
5
...