Copyright © University of Cambridge. All rights reserved.

'Painted Octahedron' printed from https://nrich.maths.org/

Show menu

 


The faces of a regular octahedron are to be painted so that no two faces which have an edge in common are painted in the same colour.

What is the smallest number of colours required?






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

This problem is taken from the UKMT Mathematical Challenges.
You can find more short problems, arranged by curriculum topic, in our short problems collection.