Imagine starting with one yellow cube and covering it all over with
a single layer of red cubes, and then covering that cube with a
layer of blue cubes. How many red and blue cubes would you need?
Euler discussed whether or not it was possible to stroll around Koenigsberg crossing each of its seven bridges exactly once. Experiment with different numbers of islands and bridges.
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.
A cyclist and a runner start off simultaneously around a race track each going at a constant speed. The cyclist goes all the way around and then catches up with the runner. He then instantly turns. . . .
Can you cross each of the seven bridges that join the north and south of the river to the two islands, once and once only, without retracing your steps?
How could Penny, Tom and Matthew work out how many chocolates there
are in different sized boxes?
Jo made a cube from some smaller cubes, painted some of the faces of the large cube, and then took it apart again. 45 small cubes had no paint on them at all. How many small cubes did Jo use?
Imagine an infinitely large sheet of square dotty paper on which you can draw triangles of any size you wish (providing each vertex is on a dot). What areas is it/is it not possible to draw?
What size square corners should be cut from a square piece of paper to make a box with the largest possible volume?
Triangle numbers can be represented by a triangular array of squares. What do you notice about the sum of identical triangle numbers?
The picture illustrates the sum 1 + 2 + 3 + 4 = (4 x 5)/2. Prove the general formula for the sum of the first n natural numbers and the formula for the sum of the cubes of the first n natural. . . .
Which hexagons tessellate?
Imagine a stack of numbered cards with one on top. Discard the top,
put the next card to the bottom and repeat continuously. Can you
predict the last card?
In a three-dimensional version of noughts and crosses, how many winning lines can you make?
Choose a couple of the sequences. Try to picture how to make the next, and the next, and the next... Can you describe your reasoning?
Show that among the interior angles of a convex polygon there
cannot be more than three acute angles.
Three circles have a maximum of six intersections with each other.
What is the maximum number of intersections that a hundred circles
Use the animation to help you work out how many lines are needed to draw mystic roses of different sizes.
What would be the smallest number of moves needed to move a Knight
from a chess set from one corner to the opposite corner of a 99 by
99 square board?
Draw a square. A second square of the same size slides around the
first always maintaining contact and keeping the same orientation.
How far does the dot travel?
Can you use the diagram to prove the AM-GM inequality?
Can you describe this route to infinity? Where will the arrows take you next?
Some students have been working out the number of strands needed for different sizes of cable. Can you make sense of their solutions?
Watch these videos to see how Phoebe, Alice and Luke chose to draw 7 squares. How would they draw 100?
Square numbers can be represented as the sum of consecutive odd
numbers. What is the sum of 1 + 3 + ..... + 149 + 151 + 153?
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?
Two motorboats travelling up and down a lake at constant speeds
leave opposite ends A and B at the same instant, passing each
other, for the first time 600 metres from A, and on their return,
400. . . .
To avoid losing think of another very well known game where the
patterns of play are similar.
The opposite vertices of a square have coordinates (a,b) and (c,d). What are the coordinates of the other vertices?
The reader is invited to investigate changes (or permutations) in the ringing of church bells, illustrated by braid diagrams showing the order in which the bells are rung.
Can you find a rule which relates triangular numbers to square numbers?
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.
A tilted square is a square with no horizontal sides. Can you
devise a general instruction for the construction of a square when
you are given just one of its sides?
Can you maximise the area available to a grazing goat?
Show that all pentagonal numbers are one third of a triangular number.
Find the point whose sum of distances from the vertices (corners)
of a given triangle is a minimum.
Can you find a rule which connects consecutive triangular numbers?
These are pictures of the sea defences at New Brighton. Can you
work out what a basic shape might be in both images of the sea wall
and work out a way they might fit together?
A standard die has the numbers 1, 2 and 3 are opposite 6, 5 and 4 respectively so that opposite faces add to 7? If you make standard dice by writing 1, 2, 3, 4, 5, 6 on blank cubes you will find. . . .
Three frogs hopped onto the table. A red frog on the left a green in the middle and a blue frog on the right. Then frogs started jumping randomly over any adjacent frog. Is it possible for them to. . . .
This is a simple version of an ancient game played all over the world. It is also called Mancala. What tactics will increase your chances of winning?
Here are four tiles. They can be arranged in a 2 by 2 square so that this large square has a green edge. If the tiles are moved around, we can make a 2 by 2 square with a blue edge... Now try to. . . .
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?
A game for 2 players
Is it possible to rearrange the numbers 1,2......12 around a clock
face in such a way that every two numbers in adjacent positions
differ by any of 3, 4 or 5 hours?
A Hamiltonian circuit is a continuous path in a graph that passes through each of the vertices exactly once and returns to the start.
How many Hamiltonian circuits can you find in these graphs?
How many moves does it take to swap over some red and blue frogs? Do you have a method?
The triangle OMN has vertices on the axes with whole number co-ordinates. How many points with whole number coordinates are there on the hypotenuse MN?
Lyndon Baker describes how the Mobius strip and Euler's law can
introduce pupils to the idea of topology.
The aim of the game is to slide the green square from the top right
hand corner to the bottom left hand corner in the least number of