Difference between revisions of "1998 USAMO Problems/Problem 4"
m (→Problem) |
|||
| Line 8: | Line 8: | ||
{{USAMO newbox|year=1998|num-b=3|num-a=5}} | {{USAMO newbox|year=1998|num-b=3|num-a=5}} | ||
[[Category:Olympiad Combinatorics Problems]] | [[Category:Olympiad Combinatorics Problems]] | ||
| + | {{MAA Notice}} | ||
Revision as of 13:34, 4 July 2013
Problem
A computer screen shows a 
chessboard, colored in the usual way. One can select with a mouse any rectangle with sides on the lines of the chessboard and click the mouse button: as a result, the colors in the selected rectangle switch (black becomes white, white becomes black). Find, with proof, the minimum number of mouse clicks needed to make the chessboard all one color.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 1998 USAMO (Problems • Resources) | ||
| Preceded by Problem 3 |
Followed by Problem 5 | |
| 1 • 2 • 3 • 4 • 5 • 6 | ||
| All USAMO Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
