2005 AMC 8 Problems/Problem 3
Revision as of 00:08, 5 July 2013 by Nathan wailes (talk | contribs)
Problem
What is the minimum number of small squares that must be colored black so that a line of symmetry lies on the diagonal 
of square 
?
![[asy]defaultpen(linewidth(1)); for ( int x = 0; x < 5; ++x ) { draw((0,x)--(4,x)); draw((x,0)--(x,4)); } fill((1,0)--(2,0)--(2,1)--(1,1)--cycle); fill((0,3)--(1,3)--(1,4)--(0,4)--cycle); fill((2,3)--(4,3)--(4,4)--(2,4)--cycle); fill((3,1)--(4,1)--(4,2)--(3,2)--cycle); label("$A$", (0, 4), NW); label("$B$", (4, 4), NE); label("$C$", (4, 0), SE); label("$D$", (0, 0), SW);[/asy]](http://latex.artofproblemsolving.com/c/0/c/c0c63cf2df2e6c50a1ecb08f11e29c8c2c0d3fb4.png)
Solution
Rotating square counterclockwise 
so that the line of symmetry 
is a vertical line makes it easier to see that 
squares need to be colored to match its corresponding square.
See Also
| 2005 AMC 8 (Problems • Answer Key • Resources) | ||
| Preceded by Problem 2 |
Followed by Problem 4 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
| All AJHSME/AMC 8 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
