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.
How many different cubes can be painted with three blue faces and
three red faces? A boy (using blue) and a girl (using red) paint
the faces of a cube in turn so that the six faces are painted. . . .
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. . . .
In how many distinct ways can six islands be joined by bridges so that each island can be reached from every other island...
Show that among the interior angles of a convex polygon there
cannot be more than three acute angles.
Can you discover whether this is a fair game?
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 standard die has the numbers 1, 2 and 3 are opposite 6, 5 and 4 respectively so that opposite faces add to 7? If you make standard dice by writing 1, 2, 3, 4, 5, 6 on blank cubes you will find. . . .
Can you cross each of the seven bridges that join the north and south of the river to the two islands, once and once only, without retracing your steps?
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?
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.
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.
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. . . .
Can you find all the 4-ball shuffles?
ABC is an equilateral triangle and P is a point in the interior of
the triangle. We know that AP = 3cm and BP = 4cm. Prove that CP
must be less than 10 cm.
A huge wheel is rolling past your window. What do you see?
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?
A 'doodle' is a closed intersecting curve drawn without taking
pencil from paper. Only two lines cross at each intersection or
vertex (never 3), that is the vertex points must be 'double points'
not. . . .
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. . . .
When number pyramids have a sequence on the bottom layer, some interesting patterns emerge...
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. . . .
In the following sum the letters A, B, C, D, E and F stand for six
distinct digits. Find all the ways of replacing the letters with
digits so that the arithmetic is correct.
Blue Flibbins are so jealous of their red partners that they will
not leave them on their own with any other bue Flibbin. What is the
quickest way of getting the five pairs of Flibbins safely to. . . .
This addition sum uses all ten digits 0, 1, 2...9 exactly once.
Find the sum and show that the one you give is the only
Factorial one hundred (written 100!) has 24 noughts when written in full and that 1000! has 249 noughts? Convince yourself that the above is true. Perhaps your methodology will help you find the. . . .
Is it true that any convex hexagon will tessellate if it has a pair
of opposite sides that are equal, and three adjacent angles that
add up to 360 degrees?
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. . . .
Do you know how to find the area of a triangle? You can count the
squares. What happens if we turn the triangle on end? Press the
button and see. Try counting the number of units in the triangle
now. . . .
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 is an interactivity in which you have to sort the steps in the
completion of the square into the correct order to prove the
formula for the solutions of quadratic equations.
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.
Replace each letter with a digit to make this addition correct.
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?
Baker, Cooper, Jones and Smith are four people whose occupations
are teacher, welder, mechanic and programmer, but not necessarily
in that order. What is each person’s occupation?
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?
Pick a square within a multiplication square and add the numbers on
each diagonal. What do you notice?
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
The tangles created by the twists and turns of the Conway rope
trick are surprisingly symmetrical. Here's why!
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. . . .
Can you arrange the numbers 1 to 17 in a row so that each adjacent
pair adds up to a square number?
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?
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.
A little bit of algebra explains this 'magic'. Ask a friend to pick 3 consecutive numbers and to tell you a multiple of 3. Then ask them to add the four numbers and multiply by 67, and to tell you. . . .
Spotting patterns can be an important first step - explaining why it is appropriate to generalise is the next step, and often the most interesting and important.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
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. . . .
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.