Pafnuty Chebyshev: Difference between revisions
Appearance
Content deleted Content added
m +link(Chebotarev's density theorem) |
m typo(was a 2x) |
||
Line 1: | Line 1: | ||
'''Pafnuty Lvovich Chebyshev''' (Пафнутий Львович Чебышев) ([[1821]]-[[1894]]) |
'''Pafnuty Lvovich Chebyshev''' (Пафнутий Львович Чебышев) ([[1821]]-[[1894]]) was a [[Russia]]n [[mathematician]]. His name is also [[transliterated]] as '''Tchebysheff''' or '''Tschebyscheff'''. |
||
The [[Chebyshev polynomials]] are named in his honor. |
The [[Chebyshev polynomials]] are named in his honor. |
Revision as of 20:09, 8 May 2003
Pafnuty Lvovich Chebyshev (Пафнутий Львович Чебышев) (1821-1894) was a Russian mathematician. His name is also transliterated as Tchebysheff or Tschebyscheff.
The Chebyshev polynomials are named in his honor.
In analog electronic there exist a filter family named "Chebyshev filters".
He is also known for his work in the field of Probability and Statistics. Chebyshev's inequality say that the probability that a random variable is more than a standard deviations away from its mean is no more than 1/a2. If μ is the mean (or expected value) and σ is the standard deviation, then we can state the relation as:
for any positive real number a. Chebyshev's inequality is used to prove the weak law of large numbers.
See also: