Difference between revisions of "1998 USAMO Problems/Problem 4"
(Created page with "== Problem == == Solution == {{solution}} ==See Also== {{USAMO newbox|year=1998|num-b=3|num-a=5}} Category:Olympiad Combinatorics Problems") |
m (→Problem) |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| + | A computer screen shows a <math>98 \times 98</math> 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 == | == Solution == | ||
Revision as of 08:07, 13 September 2012
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 | ||
