
Reasoning, convincing and proving
-
-
problem
Cube net
How many tours visit each vertex of a cube once and only once? How many return to the starting point? -
problem
The spider and the fly
A spider is sitting in the middle of one of the smallest walls in a room and a fly is resting beside the window. What is the shortest distance the spider would have to crawl to catch the fly?
-
problem
Far horizon
An observer is on top of a lighthouse. How far from the foot of the lighthouse is the horizon that the observer can see?
-
problem
The tall tower
As you come down the ladders of the Tall Tower you collect useful spells. Which way should you go to collect the most spells? -
-
problem
Water pistols
With n people anywhere in a field each shoots a water pistol at the nearest person. In general who gets wet? What difference does it make if n is odd or even? -
problem
The bridges of Konigsberg
Investigate how networks can be used to solve a problem for the 18th Century inhabitants of Konigsberg.
-
problem
Tourism
If you can copy a network without lifting your pen off the paper and without drawing any line twice, then it is traversable. Decide which of these diagrams are traversable.
-
problem
Painted cube
Imagine a large cube made from small red cubes being dropped into a pot of yellow paint. How many of the small cubes will have yellow paint on their faces?