Peter Zimmerman from Mill Hill County High School in Barnet, London gives a neat proof that: 5^(2n+1) + 11^(2n+1) + 17^(2n+1) is divisible by 33 for every non negative integer n.

This is an interactivity in which you have to sort into the correct order the steps in the proof of the formula for the sum of a geometric series.

Show that if three prime numbers, all greater than 3, form an arithmetic progression then the common difference is divisible by 6. What if one of the terms is 3?

Prove that if a^2+b^2 is a multiple of 3 then both a and b are multiples of 3.

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

The nth term of a sequence is given by the formula n^3 + 11n . Find the first four terms of the sequence given by this formula and the first term of the sequence which is bigger than one million. . . .

Which is the biggest and which the smallest of $2000^{2002}, 2001^{2001} \text{and } 2002^{2000}$?

Let a(n) be the number of ways of expressing the integer n as an ordered sum of 1's and 2's. Let b(n) be the number of ways of expressing n as an ordered sum of integers greater than 1. (i) Calculate. . . .

Find the smallest positive integer N such that N/2 is a perfect cube, N/3 is a perfect fifth power and N/5 is a perfect seventh power.

Can you see how this picture illustrates the formula for the sum of the first six cube numbers?

By considering powers of (1+x), show that the sum of the squares of the binomial coefficients from 0 to n is 2nCn

Peter Zimmerman, a Year 13 student at Mill Hill County High School in Barnet, London wrote this account of modulus arithmetic.

Make and prove a conjecture about the value of the product of the Fibonacci numbers $F_{n+1}F_{n-1}$.

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

By proving these particular identities, prove the existence of general cases.

With n people anywhere in a field each shoots a water pistol at the nearest person. In general who gets wet? What difference does it make if n is odd or even?

Generalise the sum of a GP by using derivatives to make the coefficients into powers of the natural numbers.

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?

An account of methods for finding whether or not a number can be written as the sum of two or more squares or as the sum orf two or more cubes.

Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) = 1.

We only need 7 numbers for modulus (or clock) arithmetic mod 7 including working with fractions. Explore how to divide numbers and write fractions in modulus arithemtic.

We continue the discussion given in Euclid's Algorithm I, and here we shall discover when an equation of the form ax+by=c has no solutions, and when it has infinitely many solutions.

In this 7-sandwich: 7 1 3 1 6 4 3 5 7 2 4 6 2 5 there are 7 numbers between the 7s, 6 between the 6s etc. The article shows which values of n can make n-sandwiches and which cannot.

In this article we show that every whole number can be written as a continued fraction of the form k/(1+k/(1+k/...)).

Given that a, b and c are natural numbers show that if sqrt a+sqrt b is rational then it is a natural number. Extend this to 3 variables.

Suppose A always beats B and B always beats C, then would you expect A to beat C? Not always! What seems obvious is not always true. Results always need to be proved in mathematics.

Can you work out where the blue-and-red brick roads end?

This follows up the 'magic Squares for Special Occasions' article which tells you you to create a 4by4 magicsquare with a special date on the top line using no negative numbers and no repeats.

Prove that, given any three parallel lines, an equilateral triangle always exists with one vertex on each of the three lines.

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

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

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

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.

Given that u>0 and v>0 find the smallest possible value of 1/u + 1/v given that u + v = 5 by different methods.

Imagine two identical cylindrical pipes meeting at right angles and think about the shape of the space which belongs to both pipes. Early Chinese mathematicians call this shape the mouhefanggai.

Here is a proof of Euler's formula in the plane and on a sphere together with projects to explore cases of the formula for a polygon with holes, for the torus and other solids with holes and the. . . .

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

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.

There are 12 identical looking coins, one of which is a fake. The counterfeit coin is of a different weight to the rest. What is the minimum number of weighings needed to locate the fake coin?

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

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

When if ever do you get the right answer if you add two fractions by adding the numerators and adding the denominators?

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

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?

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.