You may also like

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.

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.

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.

Simply Graphs

Age 16 to 18 Challenge Level:
What is it about some graphs that make them similar to others?
Can you think of different properties of the graphs?
Can you trace routes from one node to another?