Difference between revisions of "2001 OIM Problems/Problem 5"
(Created page with "== Problem == On a <math>2000 \times 2001</math> board the squares have coordinates <math>(x, y)</math> with <math>x, y</math> integers, <math>0 \le x le 1999</math> and <mat...") |
|||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | On a <math>2000 \times 2001</math> board the squares have coordinates <math>(x, y)</math> with <math>x, y</math> integers, <math>0 \le x le 1999</math> and <math>0 \le y \le 2000</math>. A ship on the board moves as follows: Before each movement, the ship is in a position <math>(x, y)</math> and has a speed <math>(h, v)</math> where <math>h</math> and <math>v</math> are integers. The ship chooses a new speed <math>(h',b' | + | On a <math>2000 \times 2001</math> board the squares have coordinates <math>(x, y)</math> with <math>x, y</math> integers, <math>0 \le x le 1999</math> and <math>0 \le y \le 2000</math>. A ship on the board moves as follows: Before each movement, the ship is in a position <math>(x, y)</math> and has a speed <math>(h, v)</math> where <math>h</math> and <math>v</math> are integers. The ship chooses a new speed <math>(h',b')</math> such that <math>h'-h</math> be equal to <math>−1, 0</math> or <math>1</math> and <math>v'-v</math> be equal to <math>−1, 0</math> or <math>1</math>. The new position of the ship will be <math>(x',y')</math> where <math>x'</math> is the reminder of the division of <math>x+h'</math> by 2000, and <math>y'</math> is the reminder of the division of <math>y+v'</math> by 2001. There are two ships on the board: the Martian one and the Earth one that wants to catch the Martian one. Initially each ship is on a square on the board and has speed <math>(0, 0)</math>. First moves Earth ship and continue moving alternately. Is there a strategy that always allows the Earth ship to catch the Martian ship, whatever the initial positions are? |
'''Note:''' the Earth ship, which always sees the Martian, catches the Martian if after one of its movement falls at the same position as the Martian. | '''Note:''' the Earth ship, which always sees the Martian, catches the Martian if after one of its movement falls at the same position as the Martian. | ||
Revision as of 03:24, 14 December 2023
Problem
On a 
board the squares have coordinates 
with 
integers, 
and 
. A ship on the board moves as follows: Before each movement, the ship is in a position and has a speed 
where 
and 
are integers. The ship chooses a new speed 
such that 
be equal to $−1, 0$ (Error compiling LaTeX. Unknown error_msg) or 
and 
be equal to $−1, 0$ (Error compiling LaTeX. Unknown error_msg) or . The new position of the ship will be 
where 
is the reminder of the division of 
by 2000, and 
is the reminder of the division of 
by 2001. There are two ships on the board: the Martian one and the Earth one that wants to catch the Martian one. Initially each ship is on a square on the board and has speed 
. First moves Earth ship and continue moving alternately. Is there a strategy that always allows the Earth ship to catch the Martian ship, whatever the initial positions are?
Note: the Earth ship, which always sees the Martian, catches the Martian if after one of its movement falls at the same position as the Martian.
~translated into English by Tomas Diaz. ~orders@tomasdiaz.com
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
