Copyright © University of Cambridge. All rights reserved.

'Weekly Problem 1 - 2012' printed from http://nrich.maths.org/

Show menu


Each edge of a cube is coloured either red or black. If every face of the cube has at least one black edge, what is the smallest possible number of black edges?

If you liked this problem, here is an NRICH task which challenges you to use similar mathematical ideas.

This problem is taken from the UKMT Mathematical Challenges.

View the previous week's solution
View the current weekly problem