The sums of the squares of three related numbers is also a perfect square - can you explain why?

Janine noticed, while studying some cube numbers, that if you take three consecutive whole numbers and multiply them together and then add the middle number of the three, you get the middle number. . . .

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

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

Semicircles are drawn on the sides of a rectangle ABCD. A circle passing through points ABCD carves out four crescent-shaped regions. Prove that the sum of the areas of the four crescents is equal to. . . .

Arrange the numbers 1 to 16 into a 4 by 4 array. Choose a number. Cross out the numbers on the same row and column. Repeat this process. Add up you four numbers. Why do they always add up to 34?

Show that if you add 1 to the product of four consecutive numbers the answer is ALWAYS a perfect square.

Find the largest integer which divides every member of the following sequence: 1^5-1, 2^5-2, 3^5-3, ... n^5-n.

Find some triples of whole numbers a, b and c such that a^2 + b^2 + c^2 is a multiple of 4. Is it necessarily the case that a, b and c must all be even? If so, can you explain why?

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

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.

You have been given nine weights, one of which is slightly heavier than the rest. Can you work out which weight is heavier in just two weighings of the balance?

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.

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

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

Which set of numbers that add to 10 have the largest product?

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.

A, B & C own a half, a third and a sixth of a coin collection. Each grab some coins, return some, then share equally what they had put back, finishing with their own share. How rich are they?

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?

Take any two digit number, for example 58. What do you have to do to reverse the order of the digits? Can you find a rule for reversing the order of digits for any two digit number?

Make a set of numbers that use all the digits from 1 to 9, once and once only. Add them up. The result is divisible by 9. Add each of the digits in the new number. What is their sum? Now try some. . . .

If you take two tests and get a marks out of a maximum b in the first and c marks out of d in the second, does the mediant (a+c)/(b+d)lie between the results for the two tests separately.

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.

There are four children in a family, two girls, Kate and Sally, and two boys, Tom and Ben. How old are the children?

A composite number is one that is neither prime nor 1. Show that 10201 is composite in any base.

Can you convince me of each of the following: If a square number is multiplied by a square number the product is ALWAYS a square number...

In how many ways can you arrange three dice side by side on a surface so that the sum of the numbers on each of the four faces (top, bottom, front and back) is equal?

Take any two numbers between 0 and 1. Prove that the sum of the numbers is always less than one plus their product?

Can you arrange the numbers 1 to 17 in a row so that each adjacent pair adds up to a square number?

What is the area of the quadrilateral APOQ? Working on the building blocks will give you some insights that may help you to work it out.

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

Euler found four whole numbers such that the sum of any two of the numbers is a perfect square. Three of the numbers that he found are a = 18530, b=65570, c=45986. Find the fourth number, x. You. . . .

Can you make sense of these three proofs of Pythagoras' Theorem?

Explore what happens when you draw graphs of quadratic equations with coefficients based on a geometric sequence.

If a two digit number has its digits reversed and the smaller of the two numbers is subtracted from the larger, prove the difference can never be prime.

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?

Try to solve this very difficult problem and then study our two suggested solutions. How would you use your knowledge to try to solve variants on the original problem?

In this third of five articles we prove that whatever whole number we start with for the Happy Number sequence we will always end up with some set of numbers being repeated over and over again.

This article extends the discussions in "Whole number dynamics I". Continuing the proof that, for all starting points, the Happy Number sequence goes into a loop or homes in on a fixed point.

The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.

Here are some examples of 'cons', and see if you can figure out where the trick is.

Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.

Some puzzles requiring no knowledge of knot theory, just a careful inspection of the patterns. A glimpse of the classification of knots and a little about prime knots, crossing numbers and. . . .

L triominoes can fit together to make larger versions of themselves. Is every size possible to make in this way?

The final of five articles which containe the proof of why the sequence introduced in article IV either reaches the fixed point 0 or the sequence enters a repeating cycle of four values.

Start with any whole number N, write N as a multiple of 10 plus a remainder R and produce a new whole number N'. Repeat. What happens?

This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.

This is the second article on right-angled triangles whose edge lengths are whole numbers.

Take any prime number greater than 3 , square it and subtract one. Working on the building blocks will help you to explain what is special about your results.