Update 2024-03-27: Greatly expanded the "Samples" page and renamed it to "Glossary".
Update 2024-04-04: Added 5 million mid-2011 posts from the k47 post dump. Browse (mostly) them here.
Update 2024-04-07: Added ~400 October 2003 posts from 4chan.net. Browse them here.

Welcome to Oldfriend Archive, the official 4chan archive of the NSA. Hosting ~170M text-only 2003-2014 4chan posts (mostly 2006-2008).
[23 / 0 / ?]

[1186895968] Math Puzzle

ID:nBkxoPv6 No.21741 View ViewReplyOriginalReport
/sci/ has been getting boring recently.  Let me attempt something new.  This is a math puzzle I heard about ages ago.

There are N boxes, each with a real number such that no two boxes have the same number.

The first box is opened so that you can see its contents.  You can a) choose this box or b) discard this box and open the next one [with which you repeat the procedure].  If you choose a), and the current box contains the largest number, then you win $1000.  If you choose b), then you will not be given the option of going back to the discarded box.  Of course, discarding all the boxes means that you lose by default.

What is the strategy to optimize your chances of winning, and what is this probability?

N=1, P=1
N=2, P=1/2
N=3, choosing the 1st box gives P=1/3, but if you discard the 1st box and choose the next largest box, you get P=3/6=1/2 > 1/3.
N>3, ...?