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.

Do you have enough information to work out the area of the shaded quadrilateral?

Mark a point P inside a closed curve. Is it always possible to find two points that lie on the curve, such that P is the mid point of the line joining these two points?

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?

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

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?

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

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

A introduction to how patterns can be deceiving, and what is and is not a proof.

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

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

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.

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

Kyle and his teacher disagree about his test score - who is right?

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.

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.

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

Some diagrammatic 'proofs' of algebraic identities and inequalities.

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.

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.

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

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

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.

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

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!

It is impossible to trisect an angle using only ruler and compasses but it can be done using a carpenter's square.

A blue coin rolls round two yellow coins which touch. The coins are the same size. How many revolutions does the blue coin make when it rolls all the way round the yellow coins? Investigate for a. . . .

A point moves around inside a rectangle. What are the least and the greatest values of the sum of the squares of the distances from the vertices?

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.

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.

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

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.

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

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.

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

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

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