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.

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.

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

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

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.

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

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

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

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

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

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?

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

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

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

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.

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?

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.

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

If for any triangle ABC tan(A - B) + tan(B - C) + tan(C - A) = 0 what can you say about the triangle?

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 are given a regular icosahedron having three red vertices. Show that it has a vertex that has at least two red neighbours.

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.

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.

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.

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.

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.

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

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.

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

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

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.

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

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.

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!

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

There are 12 identical looking coins, one of which is a fake. The counterfeit coin is of a different weight to the rest. What is the minimum number of weighings needed to locate the fake coin?

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.

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