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.

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

Use this interactivity to sort out the steps of the proof of the formula for the sum of an arithmetic series. The 'thermometer' will tell you how you are doing

Can you work through these direct proofs, using our interactive proof sorters?

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

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

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?

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

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

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.

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

This is an interactivity in which you have to sort the steps in the completion of the square into the correct order to prove the formula for the solutions of quadratic equations.

What can you say about the common difference of an AP where every term is prime?

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

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

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

A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.

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

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

This article discusses how every Pythagorean triple (a, b, c) can be illustrated by a square and an L shape within another square. You are invited to find some triples for yourself.

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

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.

Take a number, add its digits then multiply the digits together, then multiply these two results. If you get the same number it is an SP number.

Take a complicated fraction with the product of five quartics top and bottom and reduce this to a whole number. This is a numerical example involving some clever algebra.

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

Solve this famous unsolved problem and win a prize. Take a positive integer N. If even, divide by 2; if odd, multiply by 3 and add 1. Iterate. Prove that the sequence always goes to 4,2,1,4,2,1...

Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.

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

Prove that you cannot form a Magic W with a total of 12 or less or with a with a total of 18 or more.

The country Sixtania prints postage stamps with only three values 6 lucres, 10 lucres and 15 lucres (where the currency is in lucres).Which values cannot be made up with combinations of these postage. . . .

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.

Find all positive integers a and b for which the two equations: x^2-ax+b = 0 and x^2-bx+a = 0 both have positive integer solutions.

To find the integral of a polynomial, evaluate it at some special points and add multiples of these values.

The sum of any two of the numbers 2, 34 and 47 is a perfect square. Choose three square numbers and find sets of three integers with this property. Generalise to four integers.

A polite number can be written as the sum of two or more consecutive positive integers. Find the consecutive sums giving the polite numbers 544 and 424. What characterizes impolite numbers?

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

It is impossible to trisect an angle using only ruler and compasses but it can be done using a carpenter's square.

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?

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

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

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.

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 of two or more cubes.

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.

The first of two articles on Pythagorean Triples which asks how many right angled triangles can you find with the lengths of each side exactly a whole number measurement. Try it!

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.

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.

What fractions can you divide the diagonal of a square into by simple folding?