Difference between revisions of "1993 IMO Problems/Problem 3"
| (2 intermediate revisions by the same user not shown) | |||
| Line 4: | Line 4: | ||
== Video Solution == | == Video Solution == | ||
| − | This is a very beautifully done video solution: https://www.youtube.com/watch?v=eAROaUpkgRo | + | This is a very beautifully done video solution by YouTuber Mr. Math: https://www.youtube.com/watch?v=eAROaUpkgRo |
== Solution == | == Solution == | ||
| Line 10: | Line 10: | ||
The solution as described in the video is that all values of <math>n</math> are valid except when <math>n</math> is divisible by 3. He describes why those values are not valid using modular math and why the other ones are by creating an algorithmic pattern of reducing the matrices by taking out pieces in subarrays of 3 by m. | The solution as described in the video is that all values of <math>n</math> are valid except when <math>n</math> is divisible by 3. He describes why those values are not valid using modular math and why the other ones are by creating an algorithmic pattern of reducing the matrices by taking out pieces in subarrays of 3 by m. | ||
| − | In the video he made a mistake when reducing the 5x5 to a 2x2 as someone pointed out in the comments on the video. | + | In the video he made a mistake when reducing the 5x5 to a 2x2 as someone pointed out in the comments on the video. I made sure my animated gif for when <math>n=5</math> was correct. |
I was going to write a solution to this but since Mr. Math in the video does a really beautiful solution of it I decided to write a code that will output these animated gifs with the cases for n=1 through 10 showing them whether they're valid or not depending on how many pieces are left. I used the algorithm described by Mr. Math in the video along and some recursive functions and some visualization functions. My code can generate the animation for any value of <math>n</math> as long as there is enough memory for the file size and to handle the recursive function. I had to reduce the animated gif file sizes significantly. The original animated give for when <math>n=13</math> was 30MB. I wrote the code in Matlab. | I was going to write a solution to this but since Mr. Math in the video does a really beautiful solution of it I decided to write a code that will output these animated gifs with the cases for n=1 through 10 showing them whether they're valid or not depending on how many pieces are left. I used the algorithm described by Mr. Math in the video along and some recursive functions and some visualization functions. My code can generate the animation for any value of <math>n</math> as long as there is enough memory for the file size and to handle the recursive function. I had to reduce the animated gif file sizes significantly. The original animated give for when <math>n=13</math> was 30MB. I wrote the code in Matlab. | ||
| − | I don't know how to upload it to this page. If anyone wants the code, you can send me an email and I can gladly share it. Enjoy the animated | + | I don't know how to upload it to this page. If anyone wants the code, you can send me an email and I can gladly share it. Enjoy the animated gifs. |
| + | |||
| + | [[File:IMO1993_P3_Label_n1.png]] | ||
| + | [[File:IMO1993_P3_Label_n2.png]] | ||
| + | [[File:IMO1993_P3_Label_n3.png]] | ||
| + | [[File:IMO1993_P3_Label_n4.png]] | ||
| + | [[File:IMO1993_P3_Label_n5.png]] | ||
[[File:IMO1993_P3_n1r.gif]] | [[File:IMO1993_P3_n1r.gif]] | ||
| Line 21: | Line 27: | ||
[[File:IMO1993_P3_n4r.gif]] | [[File:IMO1993_P3_n4r.gif]] | ||
[[File:IMO1993_P3_n5r.gif]] | [[File:IMO1993_P3_n5r.gif]] | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| + | [[File:IMO1993_P3_Label_n6.png]] | ||
| + | [[File:IMO1993_P3_Label_n7.png]] | ||
| + | [[File:IMO1993_P3_Label_n8.png]] | ||
| + | [[File:IMO1993_P3_Label_n9.png]] | ||
| + | [[File:IMO1993_P3_Label_n10.png]] | ||
[[File:IMO1993_P3_n6r.gif]] | [[File:IMO1993_P3_n6r.gif]] | ||
| Line 36: | Line 41: | ||
[[File:IMO1993_P3_n10r.gif]] | [[File:IMO1993_P3_n10r.gif]] | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
Latest revision as of 20:50, 21 November 2023
Contents
Problem
On an infinite chessboard, a game is played as follows. At the start, 
pieces are arranged on the chessboard in an 
by block of adjoining squares, one piece in each square. A move in the game is a jump in a horizontal or vertical direction over an adjacent occupied square to an unoccupied square immediately beyond. The piece which has been jumped over is removed. Find those values of for which the game can end with only one piece remaining on the board.
Video Solution
This is a very beautifully done video solution by YouTuber Mr. Math: https://www.youtube.com/watch?v=eAROaUpkgRo
Solution
The solution as described in the video is that all values of are valid except when is divisible by 3. He describes why those values are not valid using modular math and why the other ones are by creating an algorithmic pattern of reducing the matrices by taking out pieces in subarrays of 3 by m.
In the video he made a mistake when reducing the 5x5 to a 2x2 as someone pointed out in the comments on the video. I made sure my animated gif for when 
was correct.
I was going to write a solution to this but since Mr. Math in the video does a really beautiful solution of it I decided to write a code that will output these animated gifs with the cases for n=1 through 10 showing them whether they're valid or not depending on how many pieces are left. I used the algorithm described by Mr. Math in the video along and some recursive functions and some visualization functions. My code can generate the animation for any value of as long as there is enough memory for the file size and to handle the recursive function. I had to reduce the animated gif file sizes significantly. The original animated give for when 
was 30MB. I wrote the code in Matlab.
I don't know how to upload it to this page. If anyone wants the code, you can send me an email and I can gladly share it. Enjoy the animated gifs.
~ Tomas Diaz. orders@tomasdiaz.com
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
See Also
| 1993 IMO (Problems) • Resources | ||
| Preceded by Problem 2 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 4 |
| All IMO Problems and Solutions | ||
