Can 100 Prisoners Beat 1-in-a-Trillion Odds?

The Prison Riddle That Should Be Impossible 100 prisoners. 100 boxes. Each may open only 50 — and if even one fails to find their own number, all of them die. Guess randomly and the odds of everyone surviving are about 1 in 10,000,000,000,000,000,000,000,000,000,000. So why does one quiet trick lift those odds to nearly 1 in 3? In this episode we build the intuition before the formula. You will see how shuffling numbers into boxes secretly creates loops, why "follow the loop" turns 100 separate gambles into a single shared bet, and why everyone walks free exactly when no loop is longer than 50. Then we watch the strange number appear: about 31.18% for 100 prisoners, settling toward 1 minus the natural log of 2 — roughly 30.7% — no matter how many prisoners you add. Along the way: where the riddle came from, why even the mathematician who posed it doubted a solution existed, and how it was later proven that no smarter strategy can beat the loop. By the end, the impossible should feel almost obvious. Sources: Gal and Miltersen, ICALP (2003); Curtin & Warshauer, optimality proof (2006); American Mathematical Monthly; Parabola, UNSW; Gathering 4 Gardner (Yossi Elran); Veritasium. Probability values from standard random-permutation cycle statistics. ▶ Visualize more mathematics here:    • Origin Math — Visual Proofs, Probability &...   🔔 Subscribe to watch math come alive, one proof at a time. © These animations and narration are original to Origin Math — re-upload or copying is not allowed. #randompermutation #probability #originmath #probabilitytheory #mathriddle #counterintuitivemath #harmonicnumbers #100prisonersproblem #combinatorics