Make and prove a conjecture about the value of the product of the Fibonacci numbers $F_{n+1}F_{n-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. . . .

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

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

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.

Prove that if the integer n is divisible by 4 then it can be written as the difference of two squares.

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.

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.

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

An iterative method for finding the value of the Golden Ratio with explanations of how this involves the ratios of Fibonacci numbers and continued fractions.

Three frogs hopped onto the table. A red frog on the left a green in the middle and a blue frog on the right. Then frogs started jumping randomly over any adjacent frog. Is it possible for them to. . . .

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

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 problem is how did Archimedes calculate the lengths of the sides of the polygons which needed him to be able to calculate square roots?

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

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.

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.

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.

Euler found four whole numbers such that the sum of any two of the numbers is a perfect square...

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.

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

Show that the arithmetic mean, geometric mean and harmonic mean of a and b can be the lengths of the sides of a right-angles triangle if and only if a = bx^3, where x is the Golden Ratio.

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

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

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

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.

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.

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.

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.

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

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

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.

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

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

A point moves around inside a rectangle. What are the least and the greatest values of the sum of the squares of the distances from the vertices?

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.

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

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

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