Chebychev's Inequality - short version

For every number k>0, the fraction of elements in a list that are k sd's or further from the arithmetic mean of the list is at most 1/k2. For random variables: for every number k>0, the probability that a random variable x is k ses or further from its expected value is at most 1/k2.

Definition in Russian| Definition in French| Definition in Japanese| Definition in Vietnamese| Definition in Greek| Definition in Polish| Definition in Turkish| Definition in Portuguese| Definition in Hindi| Definition in Swedish| Definition in Arabic| Definition in Chinese| Definition in Dutch| Definition in Hebrew| Definition in German| Definition in Korean| Definition in Italian| Definition in Spanish| Definition in Thai|