2024 USAJMO Problems/Problem 4
Revision as of 13:33, 23 March 2024 by Erinb28lms (talk | contribs)
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. A grid coloring is [i]orderly[/i] if: [list] [*]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 columns of the coloring, Rowan can then permute the rows to restore the original grid coloring. [/list] In terms of
, how many orderly colorings are there?