Bernoulli's theorem says that the relative frequency of success in a sequence of Bernoulli trials approaches the probability of success as the number of trials increases towards infinity.
It is a simplified form of the law of large numbers and derives from the Chebyshev inequality.
HISTORY
Bernoulli's theorem, sometimes called the “weak law of large numbers,” was first described by Bernoulli, Jakob (1713) in his work Ars Conjectandi, which was published (with the help of his nephew Nikolaus) seven years after his death.
MATHEMATICAL ASPECTS
If S represents the number of successes obtained during n Bernoulli trials, and if p is the probability of success, then we have:
or
where \( { \varepsilon > 0 } \) and arbitrarily small.
In an equivalent manner, we can write:
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
REFERENCES
Bernoulli, J.: Ars Conjectandi, Opus Posthumum. Accedit Tractatus de Seriebus infinitis, et Epistola Gallice scripta de ludo Pilae recticularis. Impensis Thurnisiorum, Fratrum, Basel (1713)
Rényi, A.: Probability Theory. North Holland, Amsterdam (1970)
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
(2008). Bernoulli's Theorem. In: The Concise Encyclopedia of Statistics. Springer, New York, NY. https://doi.org/10.1007/978-0-387-32833-1_28
Download citation
DOI: https://doi.org/10.1007/978-0-387-32833-1_28
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-31742-7
Online ISBN: 978-0-387-32833-1
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering