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. . . .
Explain why, when moving heavy objects on rollers, the object moves twice as fast as the rollers. Try a similar experiment yourself.
Which of these roads will satisfy a Munchkin builder?
Can you discover whether this is a fair game?
Some diagrammatic 'proofs' of algebraic identities and inequalities.
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. . . .
Can you visualise whether these nets fold up into 3D shapes? Watch the videos each time to see if you were correct.
Investigate circuits and record your findings in this simple introduction to truth tables and logic.
Can you see how this picture illustrates the formula for the sum of the first six cube numbers?
How many tours visit each vertex of a cube once and only once? How many return to the starting point?
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. . . .
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
Learn about the link between logical arguments and electronic circuits. Investigate the logical connectives by making and testing your own circuits and fill in the blanks in truth tables to record. . . .
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?
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.
Learn about the link between logical arguments and electronic circuits. Investigate the logical connectives by making and testing your own circuits and record your findings in truth tables.
Can you find the areas of the trapezia in this sequence?
What happens to the perimeter of triangle ABC as the two smaller circles change size and roll around inside the bigger circle?
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.
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. . . .
If you think that mathematical proof is really clearcut and universal then you should read this article.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
Fractional calculus is a generalisation of ordinary calculus where you can differentiate n times when n is not a whole number.
Follow the hints and prove Pick's Theorem.
An article which gives an account of some properties of magic squares.
Toni Beardon has chosen this article introducing a rich area for practical exploration and discovery in 3D geometry
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. . . .
Prove that, given any three parallel lines, an equilateral triangle always exists with one vertex on each of the three lines.
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.
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. . . .
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.
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.
Take any two numbers between 0 and 1. Prove that the sum of the numbers is always less than one plus their product?
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. . . .
By considering powers of (1+x), show that the sum of the squares of the binomial coefficients from 0 to n is 2nCn
Here the diagram says it all. Can you find the diagram?
How many noughts are at the end of these giant numbers?
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?
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. . . .
Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2
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.
Use this interactivity to sort out the steps of the proof of the formula for the sum of an arithmetic series. The 'thermometer' will tell you how you are doing
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. . . .
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?
L triominoes can fit together to make larger versions of themselves. Is every size possible to make in this way?
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?
An introduction to some beautiful results of Number Theory