Difference between revisions of "2024 USAJMO Problems/Problem 4"
Erinb28lms (talk | contribs) |
Erinb28lms (talk | contribs) m |
||
| Line 14: | Line 14: | ||
==See Also== | ==See Also== | ||
| − | {{USAJMO newbox|year=2024|num-b= | + | {{USAJMO newbox|year=2024|num-b=3|num-a=5}} |
{{MAA Notice}} | {{MAA Notice}} | ||
Revision as of 12:36, 23 March 2024
Contents
Problem
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?
Solution 1
See Also
| 2024 USAJMO (Problems • Resources) | ||
| Preceded by Problem 3 |
Followed by Problem 5 | |
| 1 • 2 • 3 • 4 • 5 • 6 | ||
| All USAJMO Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
