Jump to content

Chebyshev's theorem

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 2601:445:4380:7dd0:68ad:d5e1:7253:b8c0 (talk) at 02:45, 24 January 2021. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Chebyshev's theorem is a name given to several theorems proven by Russian mathematician Pafnuty Chebyshev.

  • Bertrand's postulate, that for every n there is a prime between n and 2n.
  • Chebyshev's inequality, on range of standard deviations around the mean, in statistics
  • Chebyshev's sum inequality, about sums and products of decreasing sequences
  • Chebyshev's equioscillation theorem, on the approximation of continuous functions with polynomials
  • The statement that if the function has a limit at infinity, then the limit is 1 (where π is the prime-counting function). This result has been superseded by the prime number theorem.