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.

Explore a number pattern which has the same symmetries in different bases.

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

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.

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

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?

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?

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

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

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.

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

Freddie Manners, of Packwood Haugh School in Shropshire solved an alphanumeric without using the extra information supplied and this article explains his reasoning.

Show that the infinite set of finite (or terminating) binary sequences can be written as an ordered list whereas the infinite set of all infinite binary sequences cannot.

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.

Take any pair of two digit numbers x=ab and y=cd where, without loss of generality, ab > cd . Form two 4 digit numbers r=abcd and s=cdab and calculate: {r^2 - s^2} /{x^2 - y^2}.

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.

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

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.

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.

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

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.

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

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?

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.

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

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

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.

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.

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.

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.

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!

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

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.

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.

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

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

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

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

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

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.

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.

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

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