When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Bertrand's box paradox - Wikipedia

    en.wikipedia.org/wiki/Bertrand's_box_paradox

    Bertrand's box paradox: the three equally probable outcomes after the first gold coin draw. The probability of drawing another gold coin from the same box is 0 in (a), and 1 in (b) and (c). Thus, the overall probability of drawing a gold coin in the second draw is ⁠ 0 / 3 ⁠ + ⁠ 1 / 3 ⁠ + ⁠ 1 / 3 ⁠ = ⁠ 2 / 3 ⁠.

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

  4. Sleeping Beauty problem - Wikipedia

    en.wikipedia.org/wiki/Sleeping_Beauty_problem

    These questions ask for the probability of two different events, and thus can have different answers, even though both events are causally dependent on the coin landing heads. (This fact is even more obvious when one considers the complementary questions: "what is the probability that two red balls were placed in the box" and "what is the ...

  5. Category:Probability theory paradoxes - Wikipedia

    en.wikipedia.org/wiki/Category:Probability...

    Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Help; Learn to edit; Community portal; Recent changes; Upload file

  6. List of probabilistic proofs of non-probabilistic theorems

    en.wikipedia.org/wiki/List_of_probabilistic...

    Non-probabilistic proofs were available earlier. Non-tangential boundary values [7] of an analytic or harmonic function exist at almost all boundary points of non-tangential boundedness. This result (Privalov's theorem), and several results of this kind, are deduced from martingale convergence. [8] Non-probabilistic proofs were available earlier.

  7. Bertrand's ballot theorem - Wikipedia

    en.wikipedia.org/wiki/Bertrand's_ballot_theorem

    In combinatorics, Bertrand's ballot problem is the question: "In an election where candidate A receives p votes and candidate B receives q votes with p > q, what is the probability that A will be strictly ahead of B throughout the count under the assumption that votes are counted in a randomly picked order?" The answer is

  8. Two envelopes problem - Wikipedia

    en.wikipedia.org/wiki/Two_envelopes_problem

    Notice that once we have fixed a probability distribution for X then the joint probability distribution of A, B is fixed, since A, B = X, Y or Y, X each with probability 1/2, independently of X, Y. The bad step 6 in the "always switching" argument led us to the finding E(B|A=a)>a for all a , and hence to the recommendation to switch, whether or ...

  9. Problem of points - Wikipedia

    en.wikipedia.org/wiki/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.