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

How could Penny, Tom and Matthew work out how many chocolates there are in different sized boxes?

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?

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?

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.

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

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.

For this challenge, you'll need to play Got It! Can you explain the strategy for winning this game with any target?

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?

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?

Can you work out how to win this game of Nim? Does it matter if you go first or second?

Square numbers can be represented as the sum of consecutive odd numbers. What is the sum of 1 + 3 + ..... + 149 + 151 + 153?

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.

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.

Four bags contain a large number of 1s, 3s, 5s and 7s. Pick any ten numbers from the bags above so that their total is 37.

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

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?

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.

The sum of the numbers 4 and 1 [1/3] is the same as the product of 4 and 1 [1/3]; that is to say 4 + 1 [1/3] = 4 × 1 [1/3]. What other numbers have the sum equal to the product and can this be so for. . . .

A little bit of algebra explains this 'magic'. Ask a friend to pick 3 consecutive numbers and to tell you a multiple of 3. Then ask them to add the four numbers and multiply by 67, and to tell you. . . .

A 2 by 3 rectangle contains 8 squares and a 3 by 4 rectangle contains 20 squares. What size rectangle(s) contain(s) exactly 100 squares? Can you find them all?

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

What are the areas of these triangles? What do you notice? Can you generalise to other "families" of triangles?

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

If you continue the pattern, can you predict what each of the following areas will be? Try to explain your prediction.

Can you find an efficient method to work out how many handshakes there would be if hundreds of people met?

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.

Charlie has made a Magic V. Can you use his example to make some more? And how about Magic Ls, Ns and Ws?

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?

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

Can you find sets of sloping lines that enclose a square?

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.

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

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

Explore the effect of reflecting in two intersecting mirror lines.

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

Charlie has moved between countries and the average income of both has increased. How can this be so?

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.

A package contains a set of resources designed to develop pupils’ mathematical thinking. This package places a particular emphasis on “generalising” and is designed to meet the. . . .

It's easy to work out the areas of most squares that we meet, but what if they were tilted?

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.

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.

Try entering different sets of numbers in the number pyramids. How does the total at the top change?

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.

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?