Problem A. 767. (January 2020)

A. 767. In an \(\displaystyle n\times n\) array all the fields are colored with a different color. In one move one can choose a row, move all the fields one place to the right, and move the last field (from the right) to the leftmost field of the row; or one can choose a column, move all the fields one place downwards, and move the field at the bottom of the column to the top field of the same column. For what values of \(\displaystyle n\) is it possible to reach any arrangement of the \(\displaystyle n\) fields using these kinds of steps?

Proposed by Ádám Schweitzer

(7 pont)

Deadline expired on February 10, 2020.

Statistics:

8 students sent a solution.
7 points:	Beke Csongor, Csaplár Viktor, Görcs András, Tóth 827 Balázs, Weisz Máté.
6 points:	Hegedűs Dániel.
5 points:	1 student.
3 points:	1 student.

Problems in Mathematics of KöMaL, January 2020