enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Monty Hall problem - Wikipedia

    en.wikipedia.org/wiki/Monty_Hall_problem

    What is the probability of winning the car by switching given the player has picked door 1 and the host has opened door 3? The answer to the first question is ⁠ 2 / 3 ⁠, as is shown correctly by the "simple" solutions. But the answer to the second question is now different: the conditional probability the car is behind door 1 or door 2 ...

  3. Newton–Pepys problem - Wikipedia

    en.wikipedia.org/wiki/Newton–Pepys_problem

    The Newton–Pepys problem is a probability problem concerning the probability of throwing sixes from a certain number of dice. [1] In 1693 Samuel Pepys and Isaac Newton corresponded over a problem posed to Pepys by a school teacher named John Smith. [2] The problem was: Which of the following three propositions has the greatest chance of success?

  4. Birthday problem - Wikipedia

    en.wikipedia.org/wiki/Birthday_problem

    Comparing p(n) = probability of a birthday match with q(n) = probability of matching your birthday. In the birthday problem, neither of the two people is chosen in advance. By contrast, the probability q(n) that at least one other person in a room of n other people has the same birthday as a particular person (for example, you) is given by

  5. Balls into bins problem - Wikipedia

    en.wikipedia.org/wiki/Balls_into_bins_problem

    The efficiency of accessing a key depends on the length of its list. If we use a single hash function which selects locations with uniform probability, with high probability the longest chain has (⁡ ⁡ ⁡) keys. A possible improvement is to use two hash functions, and put each new key in the shorter of the two lists.

  6. Boy or girl paradox - Wikipedia

    en.wikipedia.org/wiki/Boy_or_Girl_paradox

    The Boy or Girl paradox surrounds a set of questions in probability theory, which are also known as The Two Child Problem, [1] Mr. Smith's Children [2] and the Mrs. Smith Problem. The initial formulation of the question dates back to at least 1959, when Martin Gardner featured it in his October 1959 "Mathematical Games column" in Scientific ...

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

  8. Banach's matchbox problem - Wikipedia

    en.wikipedia.org/wiki/Banach's_matchbox_problem

    Banach's match problem is a classic problem in probability attributed to Stefan Banach.Feller [1] says that the problem was inspired by a humorous reference to Banach's smoking habit in a speech honouring him by Hugo Steinhaus, but that it was not Banach who set the problem or provided an answer.

  9. Bertrand paradox (probability) - Wikipedia

    en.wikipedia.org/wiki/Bertrand_paradox_(probability)

    The Bertrand paradox is a problem within the classical interpretation of probability theory. Joseph Bertrand introduced it in his work Calcul des probabilités (1889) [1] as an example to show that the principle of indifference may not produce definite, well-defined results for probabilities if it is applied uncritically when the domain of possibilities is infinite.