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

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.

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

Powers of numbers behave in surprising ways. Take a look at some of these and try to explain why they are true.

Prove that if a is a natural number and the square root of a is rational, then it is a square number (an integer n^2 for some integer n.)

Investigate the number of points with integer coordinates on circles with centres at the origin for which the square of the radius is a power of 5.

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.

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

Find a connection between the shape of a special ellipse and an infinite string of nested square roots.

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?

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

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

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.

A introduction to how patterns can be deceiving, and what is and is not a proof.

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.

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

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

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

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

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

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.

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

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.

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.

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.

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.

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

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.

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

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

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

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.

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.

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.

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.

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.

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

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

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

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 looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.