enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Coupon collector's problem - Wikipedia

    en.wikipedia.org/wiki/Coupon_collector's_problem

    In probability theory, the coupon collector's problem refers to mathematical analysis of "collect all coupons and win" contests. It asks the following question: if each box of a given product (e.g., breakfast cereals) contains a coupon, and there are n different types of coupons, what is the probability that more than t boxes need to be bought ...

  3. Chebyshev's inequality - Wikipedia

    en.wikipedia.org/wiki/Chebyshev's_inequality

    [1] [2] The term Chebyshev's inequality may also refer to Markov's inequality, especially in the context of analysis. They are closely related, and some authors refer to Markov's inequality as "Chebyshev's First Inequality," and the similar one referred to on this page as "Chebyshev's Second Inequality."

  4. Chebyshev equation - Wikipedia

    en.wikipedia.org/wiki/Chebyshev_equation

    Chebyshev's equation is the second order linear differential equation + = where p is a real (or complex) constant. The equation is named after Russian mathematician Pafnuty Chebyshev. The solutions can be obtained by power series:

  5. Chebyshev's sum inequality - Wikipedia

    en.wikipedia.org/wiki/Chebyshev's_sum_inequality

    In mathematics, Chebyshev's sum inequality, named after Pafnuty Chebyshev, states that if ...

  6. Multidimensional Chebyshev's inequality - Wikipedia

    en.wikipedia.org/wiki/Multidimensional_Chebyshev...

    In probability theory, the multidimensional Chebyshev's inequality [1] is a generalization of Chebyshev's inequality, which puts a bound on the probability of the event that a random variable differs from its expected value by more than a specified amount.

  7. Chebyshev–Markov–Stieltjes inequalities - Wikipedia

    en.wikipedia.org/wiki/Chebyshev–Markov...

    In mathematical analysis, the Chebyshev–Markov–Stieltjes inequalities are inequalities related to the problem of moments that were formulated in the 1880s by Pafnuty Chebyshev and proved independently by Andrey Markov and (somewhat later) by Thomas Jan Stieltjes. [1]

  8. Chernoff bound - Wikipedia

    en.wikipedia.org/wiki/Chernoff_bound

    It is a sharper bound than the first- or second-moment-based tail bounds such as Markov's inequality or Chebyshev's inequality, which only yield power-law bounds on tail decay. However, when applied to sums the Chernoff bound requires the random variables to be independent, a condition that is not required by either Markov's inequality or ...

  9. List of inequalities - Wikipedia

    en.wikipedia.org/wiki/List_of_inequalities

    Brezis–Gallouet inequality; Carleman's inequality; Chebyshev–Markov–Stieltjes inequalities; Chebyshev's sum inequality; Clarkson's inequalities; Eilenberg's inequality; Fekete–Szegő inequality; Fenchel's inequality; Friedrichs's inequality; Gagliardo–Nirenberg interpolation inequality; Gårding's inequality; Grothendieck inequality ...