1990 AHSME Problems/Problem 9

Revision as of 16:27, 28 September 2014 by Timneh (talk | contribs) (Created page with "== Problem == Each edge of a cube is colored either red or black. Every face of the cube has at least one black edge. The smallest number possible of black edges is <math>\text...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Each edge of a cube is colored either red or black. Every face of the cube has at least one black edge. The smallest number possible of black edges is

$\text{(A) } 2\quad \text{(B) } 3\quad \text{(C) } 4\quad \text{(D) } 5\quad \text{(E) } 6$

Solution

$\fbox{B}$

See also

1990 AHSME (ProblemsAnswer KeyResources)
Preceded by
Problem 8
Followed by
Problem 10
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