There are 100 prisoners, numbered 1-100. The prisoners' numbers are written onto 100 cards, put randomly into 100 envelopes numbered 1-100. They can't communicate, but are invited, one by one, to open 50 envelopes. If any prisoner fails to find his number, they all get killed.
They could certainly do even worse than this. If they all agreed in advance to open envelopes 1-50, then fifty of them would be guaranteed never to find their number and they'd all die. But could they come up with a strategy in advance which would improve their survival chances?
-
-
What makes this my favourite combinatorics problem is that there *is* a strategy which increases their likelihood of survival from 0.00000000000000000000000000008% to about 30%. So, what is the strategy, and why does it work?
Show this threadThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
This Tweet is unavailable.
-
...is the correct answer I didn't think of!
End of conversation
-
-
-
This Tweet is unavailable.
-
The answer is already elsewhere in this thread, so I'll try to give a hint. The prisoners can't communicate, but all prisoners gain access to new information that is common to all of them while they're opening the envelopes. They could use this to decide which envelopes to open.
End of conversation
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.