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.
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. . . .
Can you discover whether this is a fair game?
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. . . .
Arrange the numbers 1 to 16 into a 4 by 4 array. Choose a number.
Cross out the numbers on the same row and column. Repeat this
process. Add up you four numbers. Why do they always add up to 34?
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. . . .
These formulae are often quoted, but rarely proved. In this article, we derive the formulae for the volumes of a square-based pyramid and a cone, using relatively simple mathematical concepts.
A game for 2 players that can be played online. Players take it in turns to select a word from the 9 words given. The aim is to select all the occurrences of the same letter.
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
You have been given nine weights, one of which is slightly heavier
than the rest. Can you work out which weight is heavier in just two
weighings of the balance?
Can you use the diagram to prove the AM-GM inequality?
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?
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. . . .
What happens to the perimeter of triangle ABC as the two smaller
circles change size and roll around inside the bigger circle?
Can you see how this picture illustrates the formula for the sum of
the first six cube numbers?
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?
Can you arrange the numbers 1 to 17 in a row so that each adjacent
pair adds up to a square number?
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.
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. . . .
Take any whole number between 1 and 999, add the squares of the
digits to get a new number. Make some conjectures about what
happens in general.
Show that if you add 1 to the product of four consecutive numbers
the answer is ALWAYS a perfect square.
Is it possible to rearrange the numbers 1,2......12 around a clock
face in such a way that every two numbers in adjacent positions
differ by any of 3, 4 or 5 hours?
It is impossible to trisect an angle using only ruler and compasses
but it can be done using a carpenter's square.
This is the second article on right-angled triangles whose edge lengths are whole numbers.
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.
The nth term of a sequence is given by the formula n^3 + 11n . Find
the first four terms of the sequence given by this formula and the
first term of the sequence which is bigger than one million. . . .
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!
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
Find the largest integer which divides every member of the
following sequence: 1^5-1, 2^5-2, 3^5-3, ... n^5-n.
If you think that mathematical proof is really clearcut and
universal then you should read this article.
Is the mean of the squares of two numbers greater than, or less
than, the square of their means?
Three points A, B and C lie in this order on a line, and P is any
point in the plane. Use the Cosine Rule to prove the following
Four jewellers share their stock. Can you work out the relative values of their gems?
Which hexagons tessellate?
A huge wheel is rolling past your window. What do you see?
This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.
What can you say about the lengths of the sides of a quadrilateral whose vertices are on a unit circle?
Use the numbers in the box below to make the base of a top-heavy
pyramid whose top number is 200.
I am exactly n times my daughter's age. In m years I shall be ... How old am I?
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?
Find the smallest positive integer N such that N/2 is a perfect
cube, N/3 is a perfect fifth power and N/5 is a perfect seventh
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.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
Can you find all the 4-ball shuffles?
If you can copy a network without lifting your pen off the paper and without drawing any line twice, then it is traversable.
Decide which of these diagrams are traversable.
Euler discussed whether or not it was possible to stroll around Koenigsberg crossing each of its seven bridges exactly once. Experiment with different numbers of islands and bridges.
When number pyramids have a sequence on the bottom layer, some interesting patterns emerge...
Pick a square within a multiplication square and add the numbers on each diagonal. What do you notice?
Can you rearrange the cards to make a series of correct mathematical statements?
Explore what happens when you draw graphs of quadratic equations
with coefficients based on a geometric sequence.