The Chebyshev Inequality states that no more than 1/k2 of an attribute values of a given sample can be k or more standard deviations away from the attribute mean. Provide an experimental proof of this theorem by generating a sample of 10000 uniformly-distributed random numbers between 0 and 1 and computing the fractions of points that lie at larger distances than [1σ,1.5σ,2σ,2.5σ,3σ,3.5σ,4σ] is less than or equal to [1,1/1.52,1/22,1/2.52,1/32,1/3.52,1/42].
An experimental proof of Chebyshev's inequality
by Amir Shahmoradi — Last updated: