Let be one score. It has the discrete uniform distribution on , so its expected value and second moment are
Therefore
For independent throws, linearity of expectation and additivity of variance give and . The sample average consequently has expectation and variance .
The Chebyshev inequality follows by applying the Markov inequality to the nonnegative square of a centered random variable. It gives
This is at most if . Thus suffices, as does every larger integer. This is the smallest integer guaranteed by this particular Chebyshev inequality bound; it need not be the smallest integer satisfying the actual probability requirement.

Articles by others on the same topic (0)

There are currently no matching articles.