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.

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.

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

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

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

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.

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

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

Pick a square within a multiplication square and add the numbers on each diagonal. What do you notice?

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

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

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

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

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.

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

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

Three frogs hopped onto the table. A red frog on the left a green in the middle and a blue frog on the right. Then frogs started jumping randomly over any adjacent frog. Is it possible for them to. . . .

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

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?

Keep constructing triangles in the incircle of the previous triangle. What happens?

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

Explain why, when moving heavy objects on rollers, the object moves twice as fast as the rollers. Try a similar experiment yourself.

The picture illustrates the sum 1 + 2 + 3 + 4 = (4 x 5)/2. Prove the general formula for the sum of the first n natural numbers and the formula for the sum of the cubes of the first n natural. . . .

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

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

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

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

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.

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

The sums of the squares of three related numbers is also a perfect square - can you explain why?

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

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

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

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

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

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

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

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

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.

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