Difference between revisions of "1990 AHSME Problems/Problem 9"
(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...") |
(No difference)
|
Revision as of 16:27, 28 September 2014
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
Solution
See also
| 1990 AHSME (Problems • Answer Key • Resources) | ||
| 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. 
