WOLFRAM NOTEBOOK

WOLFRAM|DEMONSTRATIONS PROJECT

Beat Chebyshev

​
examination range
0.25
Chebyshev's handicap
0
Chebyshev's Rule establishes a lower bound on the fraction of points in a sample lying within
k(k≥1)
standard deviations of the mean of the distribution. This lower bound exists regardless of the distribution from which the sample is drawn. This Demonstration challenges you to defeat Chebyshev's Rule. Click the graphic to create sample points. Then adjust the "examination range" slider to see if you can find any example for which the actual fraction of points within the gray rectangle that represents the range is less than the amount guaranteed by Chebyshev. Having trouble? Increase Chebyshev's handicap until you are able to "beat Chebyshev."
Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.