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.

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

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

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

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

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?

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

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

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

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.

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 sums of the squares of three related numbers is also a perfect square - can you explain why?

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

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

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

Which set of numbers that add to 10 have the largest product?

Investigate the sequences obtained by starting with any positive 2 digit number (10a+b) and repeatedly using the rule 10a+b maps to 10b-a to get the next number in the sequence.

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

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

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.

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

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.

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

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.

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

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.

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

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

ABCD is a square. P is the midpoint of AB and is joined to C. A line from D perpendicular to PC meets the line at the point Q. Prove AQ = AD.

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

Take any rectangle ABCD such that AB > BC. The point P is on AB and Q is on CD. Show that there is exactly one position of P and Q such that APCQ is a rhombus.

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

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.

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.

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.

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.

The diagram shows a regular pentagon with sides of unit length. Find all the angles in the diagram. Prove that the quadrilateral shown in red is a rhombus.

Prove Pythagoras Theorem using enlargements and scale factors.

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

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

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.

It is obvious that we can fit four circles of diameter 1 unit in a square of side 2 without overlapping. What is the smallest square into which we can fit 3 circles of diameter 1 unit?

Take any two numbers between 0 and 1. Prove that the sum of the numbers is always less than one plus their product?