Difference between revisions of "2003 AMC 12A Problems/Problem 13"
Line 31: | Line 31: | ||
[[Category:Introductory Geometry Problems]] | [[Category:Introductory Geometry Problems]] | ||
+ | {{MAA Notice}} |
Revision as of 10:17, 4 July 2013
- The following problem is from both the 2003 AMC 12A #13 and 2003 AMC 10A #10, so both problems redirect to this page.
Problem
The polygon enclosed by the solid lines in the figure consists of 4 congruent squares joined edge-to-edge. One more congruent square is attached to an edge at one of the nine positions indicated. How many of the nine resulting polygons can be folded to form a cube with one face missing?
Solution
Solution 1
Let the squares be labeled , , , and .
When the polygon is folded, the "right" edge of square becomes adjacent to the "bottom edge" of square , and the "bottom" edge of square becomes adjacent to the "bottom" edge of square .
So, any "new" square that is attatched to those edges will prevent the polygon from becoming a cube with one face missing.
Therefore, squares , , and will prevent the polygon from becoming a cube with one face missing.
Squares , , , , , and will allow the polygon to become a cube with one face missing when folded.
Thus the answer is .
Solution 2
Another way to think of it is that a cube missing one face has of its faces. Since the shape has faces already, we need another face. The only way to add another face is if the added square does not overlap any of the others. ,, and overlap, while squares to do not. The answer is
See Also
2003 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 9 |
Followed by Problem 11 | |
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 AMC 10 Problems and Solutions |
2003 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 12 |
Followed by Problem 14 |
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 AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.