Difference between revisions of "2024 USAJMO Problems/Problem 4"
Erinb28lms (talk | contribs) m |
Erinb28lms (talk | contribs) m |
||
| Line 1: | Line 1: | ||
| − | Let <math>n \ge 3</math> be an integer. Rowan and Colin play a game on an <math> | + | Let <math>n \ge 3</math> be an integer. Rowan and Colin play a game on an <math>n \times n</math> grid of squares, where each square is colored either red or blue. Rowan is allowed to permute the rows of the grid, and Colin is allowed to permute the columns of the grid. A grid coloring is <math>orderly</math> if: |
*no matter how Rowan permutes the rows of the coloring, Colin can then permute the columns to restore the original grid coloring; and | *no matter how Rowan permutes the rows of the coloring, Colin can then permute the columns to restore the original grid coloring; and | ||
Revision as of 13:31, 23 March 2024
Let 
be an integer. Rowan and Colin play a game on an 
grid of squares, where each square is colored either red or blue. Rowan is allowed to permute the rows of the grid, and Colin is allowed to permute the columns of the grid. A grid coloring is 
if:
- no matter how Rowan permutes the rows of the coloring, Colin can then permute the columns to restore the original grid coloring; and
- no matter how Colin permutes the column of the coloring, Rowan can then permute the rows to restore the original grid coloring;
In terms of 
, how many orderly colorings are there?
