Difference between revisions of "1987 AHSME Problems/Problem 27"

(Added a solution with explanation)
(See also)
 
(One intermediate revision by the same user not shown)
(No difference)

Latest revision as of 17:45, 7 December 2020

Problem

A cube of cheese $C=\{(x, y, z)| 0 \le x, y, z \le 1\}$ is cut along the planes $x=y, y=z$ and $z=x$. How many pieces are there? (No cheese is moved until all three cuts are made.)

$\textbf{(A)}\ 5 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 7 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 9$

Solution

The cut $x = y$ separates the cube into points with $x < y$ and points with $x > y$, and analogous results apply for the other cuts. Thus, which piece a particular point is in depends only on the relative sizes of its coordinates $x$, $y$, and $z$ - for example, all points with the ordering $x < y < z$ are in the same piece. Thus, as there are $3! = 6$ possible orderings, there are $6$ pieces, which is answer $\boxed{B}$.

See also

1987 AHSME (ProblemsAnswer KeyResources)
Preceded by
Problem 26
Followed by
Problem 28
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 26 27 28 29 30
All AHSME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png