When.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

    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 ...

  3. Secretary problem - Wikipedia

    en.wikipedia.org/wiki/Secretary_problem

    Secretary problem. Graphs of probabilities of getting the best candidate (red circles) from n applications, and k / n (blue crosses) where k is the sample size. The secretary problem demonstrates a scenario involving optimal stopping theory [1][2] that is studied extensively in the fields of applied probability, statistics, and decision theory.

  4. Problem of points - Wikipedia

    en.wikipedia.org/wiki/Problem_of_points

    Problem of points. The problem of points, also called the problem of division of the stakes, is a classical problem in probability theory. One of the famous problems that motivated the beginnings of modern probability theory in the 17th century, it led Blaise Pascal to the first explicit reasoning about what today is known as an expected value.

  5. Buffon's needle problem - Wikipedia

    en.wikipedia.org/wiki/Buffon's_needle_problem

    Buffon's needle was the earliest problem in geometric probability to be solved; [2] it can be solved using integral geometry. The solution for the sought probability p, in the case where the needle length l is not greater than the width t of the strips, is. This can be used to design a Monte Carlo method for approximating the number π ...

  6. 100 prisoners problem - Wikipedia

    en.wikipedia.org/wiki/100_prisoners_problem

    100 prisoners problem. Each prisoner has to find their own number in one of 100 drawers, but may open only 50 of the drawers. The 100 prisoners problem is a mathematical problem in probability theory and combinatorics. In this problem, 100 numbered prisoners must find their own numbers in one of 100 drawers in order to survive.

  7. Urn problem - Wikipedia

    en.wikipedia.org/wiki/Urn_problem

    Urn problem. Two urns containing white and red balls. In probability and statistics, an urn problem is an idealized mental exercise in which some objects of real interest (such as atoms, people, cars, etc.) are represented as colored balls in an urn or other container. One pretends to remove one or more balls from the urn; the goal is to ...

  8. Birthday problem - Wikipedia

    en.wikipedia.org/wiki/Birthday_problem

    Consequently, the desired probability is 1 − p 0. This variation of the birthday problem is interesting because there is not a unique solution for the total number of people m + n. For example, the usual 50% probability value is realized for both a 32-member group of 16 men and 16 women and a 49-member group of 43 women and 6 men.

  9. Bayes' theorem - Wikipedia

    en.wikipedia.org/wiki/Bayes'_theorem

    Bayes' theorem (alternatively Bayes' law or Bayes' rule, after Thomas Bayes) gives a mathematical rule for inverting conditional probabilities, allowing us to find the probability of a cause given its effect. [1] For example, if the risk of developing health problems is known to increase with age, Bayes' theorem allows the risk to an individual ...

  1. Related searches probability example problems with solution calculator 1 7

    logic problems with solution