Timeline for Math puzzles for dinner
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 2, 2019 at 14:48 | comment | added | BlueRaja | @BharatRam 's solution doesn't work because rot13(lbh qba'g arrq gb xabpx ba qbbe bar). Actual solution: Purpx qbbef gjb gueh fvkgrra, gura fvkgrra gueh gjb. Guvf jbexf orpnhfr lbh fjnc cnevgl unysjnl gueh. | |
| Oct 9, 2019 at 19:12 | comment | added | Mark Dominus | This problem is addressed in general in Finding a princess in a palace: A pursuit-evasion problem (Britnell, John R. and Mark Wildon, 2012) and mentions this MO post specifically. Britnell and Wildon solve the problem for arbitrary graphs: they provide a strategy which is guaranteed to find the princess in bounded time if such a strategy exists, they characterize the graphs for which such a strategy does exist, and they show that their strategy provides the smallest bound among all such strategies. | |
| May 25, 2011 at 17:16 | comment | added | BharatRam | Ba qnl a, xabpx ba qbbe a vs a vf yrff guna 17, be 33-a bgurejvfr. Rffragvnyyl gur nethzrag vf n qvfpergr irefvba bs fubjvat gung nal pbagvahbhf shapgvba sebz [0,1] gb [0,1] unf n svkrq cbvag. Bayl gung urer, gurl pna pebff rnpu bgure, ohg gur cevaprff'f cnevgl (bqq/rira) vf svkrq, juvyr jr fhccyl n "yvar" sbe obgu pnfrf. Jvyy guvf jbex? | |
| Oct 26, 2010 at 15:42 | comment | added | Anthony Leverrier | @Vectornaut The princess can move: she could spend day n in the room number (n+1). | |
| Oct 13, 2010 at 18:13 | comment | added | Vectornaut | I'm confused! It seems like an obvious solution is "ba qnl a, xabpx ba qbbe a." But if this works, why are there only 17 rooms? | |
| Jun 29, 2010 at 19:36 | comment | added | Nate Eldredge | Nice problem! The solution I found in the end is so simple that if I hadn't proved it, I wouldn't believe that it could work. :) | |
| Jun 26, 2010 at 11:57 | history | answered | Christian Blatter | CC BY-SA 2.5 |