AoPSWiki
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.

2003 AMC 10A Problems/Problem 10

From AoPSWiki

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?

Image:2003amc10a10.gif

\mathrm{(A) \ } 2\qquad \mathrm{(B) \ } 3\qquad \mathrm{(C) \ } 4\qquad \mathrm{(D) \ } 5\qquad \mathrm{(E) \ } 6

Solution

Image:2003amc10a10solution.gif

Let the squares be labeled A, B, C, and D.

When the polygon is folded, the "right" edge of square A becomes adjacent to the "bottom edge" of square C, and the "bottom" edge of square A becomes adjacent to the "bottom" edge of square D.

So, any "new" square that is attached to those edges will prevent the polygon from becoming a cube with one face missing.

Therefore, squares 1, 2, and 3 will prevent the polygon from becoming a cube with one face missing.

Squares 4, 5, 6, 7, 8, and 9 will allow the polygon to become a cube with one face missing when folded.

Thus the answer is 6 \Rightarrow E.

Another way to think of it is that a cube missing one face has 5 of it's 6 faces. Since the shape has 4 faces already, we need another face. The only way to add anopther face is if the added square does not overlap any of the others. 1,2, and 3 overlap, while 4 \Rightarrow 9 do not. The answer is 6 \Rightarrow E

See Also

2003 AMC 10A (ProblemsResources)
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
Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us