You may also like

problem icon

Magic W Wrap Up

Prove that you cannot form a Magic W with a total of 12 or less or with a with a total of 18 or more.

problem icon

Instant Insanity

Given the nets of 4 cubes with the faces coloured in 4 colours, build a tower so that on each vertical wall no colour is repeated, that is all 4 colours appear.

problem icon

Tree Graphs

A connected graph is a graph in which we can get from any vertex to any other by travelling along the edges. A tree is a connected graph with no closed circuits (or loops. Prove that every tree has exactly one more vertex than it has edges.

Factors and Multiples Graphs

Age 14 to 18 Challenge Level:
In this example, Steve chose the numbers $2, \dots, 10$ and was able to link the factor and multiple pairs without lines crossing.