1987 AHSME Problems/Problem 27

Revision as of 08:53, 23 October 2014 by Timneh (talk | contribs) (Created page with "==Problem== A cube of cheese <math>C=\{(x, y, z)| 0 \le x, y, z \le 1\}</math> is cut along the planes <math>x=y, y=z</math> and <math>z=x</math>. How many pieces are there? (N...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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$

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