83
votes
Accepted
64
votes
Accepted
100 pieces 1 opportunity, choose wisely!
What you're missing here is the chance of playing at all, given that the game ends when someone finds the prize. (or, chance of finding a prize goes to 0, which is the same thing)
...
54
votes
Accepted
Deceptive dice game
You can make arbitrarily large sets of dice with this property.
Start with Efron's dice:
A: 4, 4, 4, 4, 0, 0
B: 3, 3, 3, 3, 3, 3
C: 6, 6, 2, 2, 2, 2
D: 5, 5, 5, 1, 1, 1
A beats B, B beats C, C ...
45
votes
Accepted
2 Monkeys on a computer
(a) I claim that the expected typing length are the same for both monkeys. I guess something in my argument will be incorrect, as jafe's answer has 9 approvals, but finding that incorrectness would be ...
43
votes
Accepted
How many tries to roll a 6?
The answer is indeed...
...because the question is equivalent to...
Calculations:
43
votes
Accepted
Monty Hall Revisited: Winning Both Goats!
Leaving aside the dubious assumption that Monty is entirely on the up-and-up...
40
votes
How many tries to roll a 6?
This surprisingly beguiling puzzle may also be solved
with a surprisingly unsophisticated approach.
Symmetry, by itself, predicts the average length of
evens-only sequences ending with 6 to ...
40
votes
Accepted
37
votes
Accepted
37
votes
36
votes
Accepted
35
votes
Accepted
Simulating an unbiased coin with a biased one
One possibility:
This works because:
EDIT: Inspired by @trolley813's answer here is a way to recycle the rejected entropy:
33
votes
Accepted
How to simulate one die with three dice?
I believe this set of dice satisfies all your requirements:
32
votes
28
votes
Coin Game with infinite paradox
OK, let's actually take this seriously. As others have said, this is the so-called St Petersburg paradox, and the reason it isn't really much of a paradox is that (1) an extra dollar matters much less ...
28
votes
Accepted
27
votes
26
votes
2 Monkeys on a computer
Monkey problem
To settle down which monkey is faster on average, I'll use Markov chains and Mathematica. Define a state $i$, for $i = 0..6$, as that the monkey 1 has currently written $i$ correct ...
25
votes
Accepted
24
votes
Three horse race
It is
The following scenarios are compatible with the information given:
Scenario 1:
Scenario 2:
Scenario 3:
23
votes
How to simulate one die with three dice?
@Deusovi's answer is totally correct, but I want to add here the general approach for solving such problems as well. No need to upvote, since I did not invent the technique, and you can see it ...
23
votes
Accepted
23
votes
What is the probability that your life will have lasted for 100 years once you die?
The frequentist answer to this question is
This is because
22
votes
Accepted
22
votes
100 pieces 1 opportunity, choose wisely!
Other people have already given correct answers, but I wanted to suggest a different way of thinking about the question that involves less calculation:
22
votes
Accepted
frog on a number line
It's easy to see by transforming the problem into a symmetric one - instead of a 1/3 vs. 2/3 jump to B or D, make a third branch so it's a uniform 1/3 chance of going to B, D, or D' (which in turn has ...
21
votes
Monty Hall variation
A difference between the Monty Hall scenario and the train platform scenario is that
After you remember that the train will definitely not be leaving from platform 2,
21
votes
Accepted
21
votes
Accepted
20
votes
Accepted
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
probability × 428mathematics × 236
strategy × 66
logical-deduction × 64
dice × 35
combinatorics × 34
game × 27
coin-tossing × 23
game-theory × 21
optimization × 18
calculation-puzzle × 13
cards × 13
geometry × 12
monty-hall × 12
story × 9
no-computers × 9
liars × 9
hat-guessing × 8
minesweeper × 8
computer-puzzle × 5
chess × 4
real × 4
time × 4
paradox × 4
coins × 4