Weekly Problem 1 - 2012

Challenge Level: Challenge Level:1

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
The NRICH Project aims to enrich the mathematical experiences of all learners. To support this aim, members of the NRICH team work in a wide range of capacities, including providing professional development for teachers wishing to embed rich mathematical tasks into everyday classroom practice. More information on many of our other activities can be found here.
Copyright © 1997 - 2012. University of Cambridge. All rights reserved.
NRICH is part of the family of activities in the Millennium Mathematics Project.