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.
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.
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. . . .
Can you use the diagram to prove the AM-GM inequality?
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?
Use the animation to help you work out how many lines are needed to draw mystic roses of different sizes.
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?
How could Penny, Tom and Matthew work out how many chocolates there
are in different sized boxes?
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?
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. . . .
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. . . .
A blue coin rolls round two yellow coins which touch. The coins are
the same size. How many revolutions does the blue coin make when it
rolls all the way round the yellow coins? Investigate for a. . . .
Can you visualise whether these nets fold up into 3D shapes? Watch the videos each time to see if you were correct.
Show that among the interior angles of a convex polygon there
cannot be more than three acute angles.
Some puzzles requiring no knowledge of knot theory, just a careful
inspection of the patterns. A glimpse of the classification of
knots and a little about prime knots, crossing numbers and. . . .
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?
In a three-dimensional version of noughts and crosses, how many winning lines can you make?
Can you discover whether this is a fair game?
Which hexagons tessellate?
Can you see how this picture illustrates the formula for the sum of
the first six cube numbers?
We are given a regular icosahedron having three red vertices. Show
that it has a vertex that has at least two red neighbours.
Square numbers can be represented as the sum of consecutive odd
numbers. What is the sum of 1 + 3 + ..... + 149 + 151 + 153?
Build gnomons that are related to the Fibonacci sequence and try to
explain why this is possible.
Some students have been working out the number of strands needed for different sizes of cable. Can you make sense of their solutions?
Triangle numbers can be represented by a triangular array of squares. What do you notice about the sum of identical triangle numbers?
Watch these videos to see how Phoebe, Alice and Luke chose to draw 7 squares. How would they draw 100?
Can you describe this route to infinity? Where will the arrows take you next?
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?
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. . . .
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?
What happens to the perimeter of triangle ABC as the two smaller
circles change size and roll around inside the bigger circle?
Three circles have a maximum of six intersections with each other.
What is the maximum number of intersections that a hundred circles
The opposite vertices of a square have coordinates (a,b) and (c,d). What are the coordinates of the other vertices?
To avoid losing think of another very well known game where the
patterns of play are similar.
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. . . .
Can you find a rule which relates triangular numbers to square numbers?
Can you find a rule which connects consecutive triangular numbers?
Find the point whose sum of distances from the vertices (corners)
of a given triangle is a minimum.
Show that all pentagonal numbers are one third of a triangular number.
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. . . .
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 game for 2 players
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 solving is at the heart of the NRICH site. All the problems
give learners opportunities to learn, develop or use mathematical
concepts and skills. Read here for more information.
How many moves does it take to swap over some red and blue frogs? Do you have a method?
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?
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?
A huge wheel is rolling past your window. What do you see?
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?