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

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.

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.

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

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.

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

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.

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.

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?

The sum of any two of the numbers 2, 34 and 47 is a perfect square. Choose three square numbers and find sets of three integers with this property. Generalise to four integers.

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.

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.

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.

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.

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.

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.

This is an interactivity in which you have to sort the steps in the completion of the square into the correct order to prove the formula for the solutions of quadratic equations.

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?

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.

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

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.

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?

To find the integral of a polynomial, evaluate it at some special points and add multiples of these values.

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

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

Find all positive integers a and b for which the two equations: x^2-ax+b = 0 and x^2-bx+a = 0 both have positive integer solutions.

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

Try to solve this very difficult problem and then study our two suggested solutions. How would you use your knowledge to try to solve variants on the original problem?

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

Start with any whole number N, write N as a multiple of 10 plus a remainder R and produce a new whole number N'. Repeat. What happens?

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?

If I tell you two sides of a right-angled triangle, you can easily work out the third. But what if the angle between the two sides is not a right angle?

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

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

Explore a number pattern which has the same symmetries in different bases.

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?

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

Sort these mathematical propositions into a series of 8 correct statements.

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

An article which gives an account of some properties of magic 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.

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