Timeline for Math puzzles for dinner
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 27, 2011 at 21:04 | history | edited | algori | CC BY-SA 2.5 |
clarified the initial condition
|
| Jan 27, 2011 at 20:59 | comment | added | algori | Christian -- or none at all! You are right, thanks, will correct this. | |
| Jan 27, 2011 at 13:08 | comment | added | Christian Blatter | I think you have to add something about the initial conditions. I can easily envisage an instance where there is exactly one collision. | |
| Jul 26, 2010 at 22:50 | comment | added | Eric Tressler | I've always liked this puzzle, because most people eventually solve it, but without noticing the elegant solution. | |
| Jul 25, 2010 at 3:12 | comment | added | algori | Jose -- glad you liked it. Your answer is correct. Actually, fvapr gur pbyyvfvbaf ner rynfgvp, bar pna guvax bs gur onyyf nf vs gurl cnffrq evtug guebhtu rnpu bgure vafgrnq bs pbyyvqvat. | |
| Jul 25, 2010 at 2:34 | comment | added | José Figueroa-O'Farrill | This is a fun puzzle! V guvax vg vf gur cebqhpg bs gur ahzore bs onyyf zbivat gb gur yrsg gvzrf gur ahzore bs onyyf zbivat gb gur evtug. (V zbqry guvf hfvat fcva punvaf...) | |
| Jun 24, 2010 at 4:58 | history | answered | algori | CC BY-SA 2.5 |