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

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?

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

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

Some puzzles requiring no knowledge of knot theory, just a careful inspection of the patterns. A glimpse of the classification of knots and a little about prime knots, crossing numbers and. . . .

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.

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

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?

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

What can you say about the lengths of the sides of a quadrilateral whose vertices are on a unit circle?

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}$?

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

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?

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

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

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

Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2

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?

Toni Beardon has chosen this article introducing a rich area for practical exploration and discovery in 3D geometry

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.

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

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.

Problem solving is at the heart of the NRICH site. All the problems give learners opportunities to learn, develop or use mathematical concepts and skills. Read here for more information.

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.

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?

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

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.

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.

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.

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

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

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

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.

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?

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

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

Can you visualise whether these nets fold up into 3D shapes? Watch the videos each time to see if you were correct.

An inequality involving integrals of squares of functions.

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.

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

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?