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.

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

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.

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.

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.

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

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.

What can you say about the common difference of an AP where every term is prime?

Can you find the areas of the trapezia in this sequence?

A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.

An article about the strategy for playing The Triangle Game which appears on the NRICH site. It contains a simple lemma about labelling a grid of equilateral triangles within a triangular frame.

If you think that mathematical proof is really clearcut and universal then you should read this article.

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

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

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 you cannot form a Magic W with a total of 12 or less or with a with a total of 18 or more.

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.

Can you work through these direct proofs, using our interactive proof sorters?

Can you rearrange the cards to make a series of correct mathematical statements?

You have twelve weights, one of which is different from the rest. Using just 3 weighings, can you identify which weight is the odd one out, and whether it is heavier or lighter than the rest?

Have a go at being mathematically negative, by negating these statements.

Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.

L triominoes can fit together to make larger versions of themselves. Is every size possible to make in this way?

Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.

This article invites you to get familiar with a strategic game called "sprouts". The game is simple enough for younger children to understand, and has also provided experienced mathematicians with. . . .

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.

This is the second of two articles and discusses problems relating to the curvature of space, shortest distances on surfaces, triangulations of surfaces and representation by graphs.

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

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

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?

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

A connected graph is a graph in which we can get from any vertex to any other by travelling along the edges. A tree is a connected graph with no closed circuits (or loops. Prove that every tree has. . . .

The knight's move on a chess board is 2 steps in one direction and one step in the other direction. Prove that a knight cannot visit every square on the board once and only (a tour) on a 2 by n board. . . .

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.

Can you explain why a sequence of operations always gives you perfect squares?

Show that for natural numbers x and y if x/y > 1 then x/y>(x+1)/(y+1}>1. Hence prove that the product for i=1 to n of [(2i)/(2i-1)] tends to infinity as n tends to infinity.

Clearly if a, b and c are the lengths of the sides of an equilateral triangle then a^2 + b^2 + c^2 = ab + bc + ca. Is the converse true?

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?

Four identical right angled triangles are drawn on the sides of a square. Two face out, two face in. Why do the four vertices marked with dots lie on one line?

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

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.

When if ever do you get the right answer if you add two fractions by adding the numerators and adding the denominators?