Difference between revisions of "2024 IMO Problems/Problem 5"
(Created page with "Turbo the snail plays a game on a board with 2024 rows and 2023 columns. There are hidden monsters in 2022 of the cells. Initially, Turbo does not know where any of the monste...") |
Bobwang001 (talk | contribs) |
||
| (9 intermediate revisions by 5 users not shown) | |||
| Line 14: | Line 14: | ||
Determine the minimum value of <math>n</math> for which Turbo has a strategy that guarantees reaching | Determine the minimum value of <math>n</math> for which Turbo has a strategy that guarantees reaching | ||
the last row on the <math>n^{th}</math> attempt or earlier, regardless of the locations of the monsters. | the last row on the <math>n^{th}</math> attempt or earlier, regardless of the locations of the monsters. | ||
| + | |||
| + | ==Video Solution== | ||
| + | https://youtu.be/wfQkk9WktGE (including commentary and some fun facts / backstory!) | ||
| + | |||
| + | ==Video Solution 2 - THE MOST TROLL IMO PROBLEM IN HISTORY - fast solve== | ||
| + | https://www.youtube.com/watch?v=-E4Oab4DImg&t=4s | ||
| + | |||
| + | ==Video Solution 3== | ||
| + | https://youtu.be/vxcEKbqr3h0 | ||
| + | |||
| + | ==Video Solution，中文版，subtitle in English, 5 mins long == | ||
| + | https://youtu.be/-7s16_5No_g | ||
| + | ==See Also== | ||
| + | |||
| + | {{IMO box|year=2024|num-b=4|num-a=6}} | ||
| + | |||
| + | |||
| + | Docs link for solution from Mathismyfriend24 below | ||
| + | https://docs.google.com/document/d/12R9Re7aOdKWvyZN1Nwik79l-rBpmn9DcujWIhuyBpbw/edit?usp=sharing | ||
Latest revision as of 15:54, 10 October 2024
Turbo the snail plays a game on a board with 2024 rows and 2023 columns. There are hidden monsters in 2022 of the cells. Initially, Turbo does not know where any of the monsters are, but he knows that there is exactly one monster in each row except the first row and the last row, and that each column contains at most one monster.
Turbo makes a series of attempts to go from the first row to the last row. On each attempt, he chooses to start on any cell in the first row, then repeatedly moves to an adjacent cell sharing a common side. (He is allowed to return to a previously visited cell.) If he reaches a cell with a monster, his attempt ends and he is transported back to the first row to start a new attempt. The monsters do not move, and Turbo remembers whether or not each cell he has visited contains a monster. If he reaches any cell in the last row, his attempt ends and the game is over.
Determine the minimum value of 
for which Turbo has a strategy that guarantees reaching
the last row on the 
attempt or earlier, regardless of the locations of the monsters.
Contents
Video Solution
https://youtu.be/wfQkk9WktGE (including commentary and some fun facts / backstory!)
Video Solution 2 - THE MOST TROLL IMO PROBLEM IN HISTORY - fast solve
https://www.youtube.com/watch?v=-E4Oab4DImg&t=4s
Video Solution 3
Video Solution，中文版，subtitle in English, 5 mins long
See Also
| 2024 IMO (Problems) • Resources | ||
| Preceded by Problem 4 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 6 |
| All IMO Problems and Solutions | ||
Docs link for solution from Mathismyfriend24 below
https://docs.google.com/document/d/12R9Re7aOdKWvyZN1Nwik79l-rBpmn9DcujWIhuyBpbw/edit?usp=sharing
