1998 CEMC Gauss (Grade 7) Problems/Problem 20
Revision as of 15:45, 29 January 2021 by Coolmath34 (talk | contribs) (Created page with "== Problem == Each of the 12 edges of a cube is coloured either red or green. Every face of the cube has at least one red edge. What is the smallest number of red edges? <ma...")
Problem
Each of the 12 edges of a cube is coloured either red or green. Every face of the cube has at least one red edge. What is the smallest number of red edges?
Solution
Let the vertices of the cube be Shade , and That way, every face contains at least one red edge, and the answer is