Take any whole number between 1 and 999, add the squares of the digits to get a new number. Make some conjectures about what happens in general.

Choose any 3 digits and make a 6 digit number by repeating the 3 digits in the same order (e.g. 594594). Explain why whatever digits you choose the number will always be divisible by 7, 11 and 13.

Take any two positive numbers. Calculate the arithmetic and geometric means. Repeat the calculations to generate a sequence of arithmetic means and geometric means. Make a note of what happens to the. . . .

Start with any number of counters in any number of piles. 2 players take it in turns to remove any number of counters from a single pile. The loser is the player who takes the last counter.

Start with any number of counters in any number of piles. 2 players take it in turns to remove any number of counters from a single pile. The winner is the player to take the last counter.

Pick the number of times a week that you eat chocolate. This number must be more than one but less than ten. Multiply this number by 2. Add 5 (for Sunday). Multiply by 50... Can you explain why it. . . .

A three digit number abc is always divisible by 7 when 2a+3b+c is divisible by 7. Why?

What would you get if you continued this sequence of fraction sums? 1/2 + 2/1 = 2/3 + 3/2 = 3/4 + 4/3 =

Consider all two digit numbers (10, 11, . . . ,99). In writing down all these numbers, which digits occur least often, and which occur most often ? What about three digit numbers, four digit numbers. . . .

Find some examples of pairs of numbers such that their sum is a factor of their product. eg. 4 + 12 = 16 and 4 × 12 = 48 and 16 is a factor of 48.

This article for teachers describes several games, found on the site, all of which have a related structure that can be used to develop the skills of strategic planning.

List any 3 numbers. It is always possible to find a subset of adjacent numbers that add up to a multiple of 3. Can you explain why and prove it?

A game for 2 players. Set out 16 counters in rows of 1,3,5 and 7. Players take turns to remove any number of counters from a row. The player left with the last counter looses.

Investigate sequences given by $a_n = \frac{1+a_{n-1}}{a_{n-2}}$ for different choices of the first two terms. Make a conjecture about the behaviour of these sequences. Can you prove your conjecture?

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?

The diagram illustrates the formula: 1 + 3 + 5 + ... + (2n - 1) = n² Use the diagram to show that any odd number is the difference of two squares.

An article for teachers and pupils that encourages you to look at the mathematical properties of similar games.

Can you explain the surprising results Jo found when she calculated the difference between square numbers?

Imagine we have four bags containing a large number of 1s, 4s, 7s and 10s. What numbers can we make?

Some students have been working out the number of strands needed for different sizes of cable. Can you make sense of their solutions?

Imagine we have four bags containing numbers from a sequence. What numbers can we make now?

Use the animation to help you work out how many lines are needed to draw mystic roses of different sizes.

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.

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.

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?

When number pyramids have a sequence on the bottom layer, some interesting patterns emerge...

A game for 2 players with similaritlies to NIM. Place one counter on each spot on the games board. Players take it is turns to remove 1 or 2 adjacent counters. The winner picks up the last counter.

To avoid losing think of another very well known game where the patterns of play are similar.

You can work out the number someone else is thinking of as follows. Ask a friend to think of any natural number less than 100. Then ask them to tell you the remainders when this number is divided by. . . .

Build gnomons that are related to the Fibonacci sequence and try to explain why this is possible.

Three circles have a maximum of six intersections with each other. What is the maximum number of intersections that a hundred circles could have?

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?

It would be nice to have a strategy for disentangling any tangled ropes...

We can show that (x + 1)² = x² + 2x + 1 by considering the area of an (x + 1) by (x + 1) square. Show in a similar way that (x + 2)² = x² + 4x + 4

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?

Caroline and James pick sets of five numbers. Charlie chooses three of them that add together to make a multiple of three. Can they stop him?

Can you find the values at the vertices when you know the values on the edges?

Pick a square within a multiplication square and add the numbers on each diagonal. What do you notice?

Explore the effect of combining enlargements.

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.

Spotting patterns can be an important first step - explaining why it is appropriate to generalise is the next step, and often the most interesting and important.

Delight your friends with this cunning trick! Can you explain how it works?

Great Granddad is very proud of his telegram from the Queen congratulating him on his hundredth birthday and he has friends who are even older than he is... When was he born?

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.

Explore the effect of reflecting in two intersecting mirror lines.