Magic W
Find all the ways of placing the numbers 1 to 9 on a W shape, with 3 numbers on each leg, so that each set of 3 numbers has the same total.
Find all the ways of placing the numbers 1 to 9 on a W shape, with 3 numbers on each leg, so that each set of 3 numbers has the same total.
Imagine you had to plan the tour for the Olympic Torch. Is there an efficient way of choosing the shortest possible route?
Find the point whose sum of distances from the vertices (corners) of a given triangle is a minimum.
Explore some of the different types of network, and prove a result about network trees.
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.
How many tours visit each vertex of a cube once and only once? How many return to the starting point?