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?

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

Can you find the values at the vertices when you know the values on the edges of these multiplication arithmagons?

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 likes tablecloths that use as many colours as possible, but insists that his tablecloths have some symmetry. Can you work out how many colours he needs for different tablecloth designs?

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?

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.

Show that for any triangle it is always possible to construct 3 touching circles with centres at the vertices. Is it possible to construct touching circles centred at the vertices of any polygon?

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.

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.

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

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.

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

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

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.

Many numbers can be expressed as the difference of two perfect squares. What do you notice about the numbers you CANNOT make?

These gnomons appear to have more than a passing connection with the Fibonacci sequence. This problem ask you to investigate some of these connections.

Is there a relationship between the coordinates of the endpoints of a line and the number of grid squares it crosses?

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?

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.

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

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

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

Choose four consecutive whole numbers. Multiply the first and last numbers together. Multiply the middle pair together. What do you notice?

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

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

Can you describe this route to infinity? Where will the arrows take you next?

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

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?

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

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?

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

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

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.

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?

Jo has three numbers which she adds together in pairs. When she does this she has three different totals: 11, 17 and 22 What are the three numbers Jo had to start with?”

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

Explore the effect of reflecting in two intersecting mirror lines.

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?

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

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 show that you can share a square pizza equally between two people by cutting it four times using vertical, horizontal and diagonal cuts through any point inside the square?

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?

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.