AoPSWiki
Visit the AoPS Book Store.
Personal tools

1991 AJHSME Problems/Problem 16

From AoPSWiki

Problem

The 16 squares on a piece of paper are numbered as shown in the diagram. While lying on a table, the paper is folded in half four times in the following sequence:

(1) fold the top half over the bottom half

(2) fold the bottom half over the top half

(3) fold the right half over the left half

(4) fold the left half over the right half.

Which numbered square is on top after step 4?

unitsize(18);for(int a=0; a<5; ++a) { draw((a,0)--(a,4)); }for(int b=0; b<5; ++b) { draw((0,b)--(4,b)); }label("...

\text{(A)}\ 1 \qquad \text{(B)}\ 9 \qquad \text{(C)}\ 10 \qquad \text{(D)}\ 14 \qquad \text{(E)}\ 16

Solution

Suppose we undo each of the four folds, considering just the top square until we completely unfold the paper. x will be marked in the square if the face that shows after all the folds is face up, y if that face is facing down.

Step 0: unitsize(18);draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); label("$x$",(0.5,0.1),N); Step 1: unitsize(18);draw((0,0)--(2,0)--(2,1)--(0,1)--cycle); draw((1,0)--(1,1));label("$y$",(0.5,0.1),N); Step 2: unitsize(18);draw((0,0)--(4,0)--(4,1)--(0,1)--cycle); draw((1,0)--(1,1)); draw((2,0)--(2,1)); draw((3,0)--(3,1));label("... Step 3: unitsize(18);draw((0,0)--(4,0)--(4,2)--(0,2)--cycle);draw((0,1)--(4,1)); draw((1,0)--(1,2)); draw((2,0)--(2,2)); draw((3,0)--... Step 4: unitsize(18);for(int a=0; a<5; ++a) { draw((a,0)--(a,4)); }for(int b=0; b<5; ++b) { draw((0,b)--(4,b)); }label("... The marked square is in the same spot as the number 9\rightarrow \boxed{\text{B}}.

See Also

1991 AJHSME (Problems • Resources)
Preceded by
Problem 15 		Followed by
Problem 17
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
Retrieved from "http://www.artofproblemsolving.com/Wiki/index.php/1991_AJHSME_Problems/Problem_16"
Do you have what it takes to be the next brilliant trader, researcher, or developer at Jane Street Capital? Find out in the Careers in Mathematics Forum.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • Foundation • Privacy • Contact Us