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.

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.

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

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

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.

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

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?

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

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

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

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

Factorial one hundred (written 100!) has 24 noughts when written in full and that 1000! has 249 noughts? Convince yourself that the above is true. Perhaps your methodology will help you find the. . . .

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?

Find the largest integer which divides every member of the following sequence: 1^5-1, 2^5-2, 3^5-3, ... n^5-n.

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

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

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

This problem is a sequence of linked mini-challenges leading up to the proof of a difficult final challenge, encouraging you to think mathematically. Starting with one of the mini-challenges, how. . . .

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

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.

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

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?

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.

Which of these triangular jigsaws are impossible to finish?

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

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 real solutions of the equation (x^2-7x+11)^(x^2-11x+30) = 1.

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

We are given a regular icosahedron having three red vertices. Show that it has a vertex that has at least two red neighbours.

Prove that in every tetrahedron there is a vertex such that the three edges meeting there have lengths which could be the sides of a triangle.

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.

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

Take any whole number q. Calculate q^2 - 1. Factorize q^2-1 to give two factors a and b (not necessarily q+1 and q-1). Put c = a + b + 2q . Then you will find that ab+1 , bc+1 and ca+1 are all. . . .

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.

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.

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

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

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.

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.

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.

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.

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

Clearly if a, b and c are the lengths of the sides of a triangle and the triangle is equilateral then a^2 + b^2 + c^2 = ab + bc + ca. Is the converse true, and if so can you prove it? That is if. . . .

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.