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.

Triangle numbers can be represented by a triangular array of squares. What do you notice about the sum of identical triangle numbers?

A game for 2 people. Take turns joining two dots, until your opponent is unable to move.

An extension of noughts and crosses in which the grid is enlarged and the length of the winning line can to altered to 3, 4 or 5.

An irregular tetrahedron is composed of four different triangles. Can such a tetrahedron be constructed where the side lengths are 4, 5, 6, 7, 8 and 9 units of length?

Bilbo goes on an adventure, before arriving back home. Using the information given about his journey, can you work out where Bilbo lives?

What can you see? What do you notice? What questions can you ask?

How can the same pieces of the tangram make this bowl before and after it was chipped? Use the interactivity to try and work out what is going on!

I found these clocks in the Arts Centre at the University of Warwick intriguing - do they really need four clocks and what times would be ambiguous with only two or three of them?

Can you see why 2 by 2 could be 5? Can you predict what 2 by 10 will be?

Investigate how the four L-shapes fit together to make an enlarged L-shape. You could explore this idea with other shapes too.

How many winning lines can you make in a three-dimensional version of noughts and crosses?

A game for 2 players. Given a board of dots in a grid pattern, players take turns drawing a line by connecting 2 adjacent dots. Your goal is to complete more squares than your opponent.

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 moves.

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.

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.

Hover your mouse over the counters to see which ones will be removed. Click to remover them. The winner is the last one to remove a counter. How you can make sure you win?

You have 4 red and 5 blue counters. How many ways can they be placed on a 3 by 3 grid so that all the rows columns and diagonals have an even number of red counters?

A tetromino is made up of four squares joined edge to edge. Can this tetromino, together with 15 copies of itself, be used to cover an eight by eight chessboard?

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 many different triangles can you make on a circular pegboard that has nine pegs?

Blue Flibbins are so jealous of their red partners that they will not leave them on their own with any other bue Flibbin. What is the quickest way of getting the five pairs of Flibbins safely to. . . .

Cut four triangles from a square as shown in the picture. How many different shapes can you make by fitting the four triangles back together?

Exchange the positions of the two sets of counters in the least possible number of moves

Square It game for an adult and child. Can you come up with a way of always winning this game?

This task depends on groups working collaboratively, discussing and reasoning to agree a final product.

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.

Can you fit the tangram pieces into the outlines of Mai Ling and Chi Wing?

A magician took a suit of thirteen cards and held them in his hand face down. Every card he revealed had the same value as the one he had just finished spelling. How did this work?

Can you fit the tangram pieces into the outlines of the watering can and man in a boat?

Which of these dice are right-handed and which are left-handed?

Can you fit the tangram pieces into the outline of this telephone?

Can you fit the tangram pieces into the outline of this shape. How would you describe it?

Can you fit the tangram pieces into the outlines of the candle and sundial?

Slide the pieces to move Khun Phaen past all the guards into the position on the right from which he can escape to freedom.

Use the interactivity to listen to the bells ringing a pattern. Now it's your turn! Play one of the bells yourself. How do you know when it is your turn to ring?

Can you fit the tangram pieces into the outline of Little Ming and Little Fung dancing?

Can you fit the tangram pieces into the outlines of the workmen?

How many DIFFERENT quadrilaterals can be made by joining the dots on the 8-point circle?

Can you fit the tangram pieces into the outlines of the chairs?

Can you fit the tangram pieces into the outline of Little Ming playing the board game?

We start with one yellow cube and build around it to make a 3x3x3 cube with red cubes. Then we build around that red cube with blue cubes and so on. How many cubes of each colour have we used?

Can you fit the tangram pieces into the outlines of these people?

Can you fit the tangram pieces into the outlines of these clocks?

Players take it in turns to choose a dot on the grid. The winner is the first to have four dots that can be joined to form a square.

Investigate the number of paths you can take from one vertex to another in these 3D shapes. Is it possible to take an odd number and an even number of paths to the same vertex?

A shape and space game for 2,3 or 4 players. Be the last person to be able to place a pentomino piece on the playing board. Play with card, or on the computer.

Can you fit the tangram pieces into the outline of this brazier for roasting chestnuts?

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?