The tangles created by the twists and turns of the Conway rope trick are surprisingly symmetrical. Here's why!

Explore the continued fraction: 2+3/(2+3/(2+3/2+...)) What do you notice when successive terms are taken? What happens to the terms if the fraction goes on indefinitely?

How many tours visit each vertex of a cube once and only once? How many return to the starting point?

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

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.

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?

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 iterative method for finding the value of the Golden Ratio with explanations of how this involves the ratios of Fibonacci numbers and continued fractions.

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

Can you find the value of this function involving algebraic fractions for x=2000?

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?

What is the area of the quadrilateral APOQ? Working on the building blocks will give you some insights that may help you to work it out.

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

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

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

Four jewellers share their stock. Can you work out the relative values of their gems?

By proving these particular identities, prove the existence of general cases.

The country Sixtania prints postage stamps with only three values 6 lucres, 10 lucres and 15 lucres (where the currency is in lucres).Which values cannot be made up with combinations of these postage. . . .

Draw a 'doodle' - a closed intersecting curve drawn without taking pencil from paper. What can you prove about the intersections?

I want some cubes painted with three blue faces and three red faces. How many different cubes can be painted like that?

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.

Fractional calculus is a generalisation of ordinary calculus where you can differentiate n times when n is not a whole number.

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

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.

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.

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

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 article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.

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?

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

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.

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.

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.

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

Solve this famous unsolved problem and win a prize. Take a positive integer N. If even, divide by 2; if odd, multiply by 3 and add 1. Iterate. Prove that the sequence always goes to 4,2,1,4,2,1...

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.

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.

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.

Patterns that repeat in a line are strangely interesting. How many types are there and how do you tell one type from another?

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