You may also like

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.

Magic Caterpillars

Label the joints and legs of these graph theory caterpillars so that the vertex sums are all equal.

Factors and Multiples Graphs

Age 16 to 18 Challenge Level:

You might like to play the factors and multiples game before attempting this investigation, which can be taken to many levels of complexity.

Write down a selection of positive whole numbers less than 100 in some positions of your choice on a large blank piece of paper.

Now, draw lines (not necessarily straight) which join each number in the selection with all of the factors and multiples of the number in the selection.

For your selection and arrangement of numbers, can you draw lines so that none cross?