Skip to main content
Log in

On Chebyshev’s Theorem and Bernoulli’s Law of Large Numbers

  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

The law of large numbers for the case of tossing the fair coin is proven. The proof is based on the method that Chebyshev used to prove his inequality and does not require concepts such as independence, mathematical expectation, and variance. Only the concepts of equiprobability of events, the formula of classical probability, the simplest concepts of combinatorics, and Newton’s binomial formula are assumed to be known.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. J. Bernoulli, Ars Conjectandi (Impensis Thurnisiorum, Fratrum, Basileae, 1713).

  2. O. P. Vinogradov, On Probability Theory for School Students, Part 1: Handbook (Spets. Uchebno-Nauch. Tsentr, Mosk. Gos. Univ., Moscow, 2015).

  3. O. P. Vinogradov, ‘‘On large numbers law for school students,’’ Math. Ed., No. 2, 2–6 (2019).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to O. P. Vinogradov.

Additional information

Translated by I. Obrezanova

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vinogradov, O.P. On Chebyshev’s Theorem and Bernoulli’s Law of Large Numbers. Moscow Univ. Math. Bull. 76, 135–138 (2021). https://doi.org/10.3103/S0027132221030086

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132221030086

Keywords:

Navigation