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?

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

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

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.

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.

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

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.

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

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

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.

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.

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.

Do you notice anything about the solutions when you add and/or subtract consecutive negative numbers?

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?

The NRICH team are always looking for new ways to engage teachers and pupils in problem solving. Here we explain the thinking behind maths trails.

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

The opposite vertices of a square have coordinates (a,b) and (c,d). What are the coordinates of the other vertices?

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

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?

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

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

Jo made a cube from some smaller cubes, painted some of the faces of the large cube, and then took it apart again. 45 small cubes had no paint on them at all. How many small cubes did Jo use?

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

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

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

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

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

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.

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

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

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.

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

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?”

Can you find the area of a parallelogram defined by two vectors?

What is the volume of the solid formed by rotating this right angled triangle about the hypotenuse?

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?

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.

An article which gives an account of some properties of magic squares.

Can you explain the strategy for winning this game with any target?

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

An account of some magic squares and their properties and and how to construct them for yourself.

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?

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

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?