In how many distinct ways can six islands be joined by bridges so that each island can be reached from every other island...
The tangles created by the twists and turns of the Conway rope
trick are surprisingly symmetrical. Here's why!
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.
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 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?
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. . . .
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. . . .
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.
After some matches were played, most of the information in the
table containing the results of the games was accidentally deleted.
What was the score in each match played?
Three dice are placed in a row. Find a way to turn each one so that
the three numbers on top of the dice total the same as the three
numbers on the front of the dice. Can you find all the ways to. . . .
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?
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.
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. . . .
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. . . .
Here are some examples of 'cons', and see if you can figure out where the trick is.
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. . . .
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. . . .
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. . . .
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.
Carry out cyclic permutations of nine digit numbers containing the
digits from 1 to 9 (until you get back to the first number). Prove
that whatever number you choose, they will add to the same total.
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.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
Write down a three-digit number Change the order of the digits to
get a different number Find the difference between the two three
digit numbers Follow the rest of the instructions then try. . . .
This jar used to hold perfumed oil. It contained enough oil to fill
granid silver bottles. Each bottle held enough to fill ozvik golden
goblets and each goblet held enough to fill vaswik crystal. . . .
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.
Show that among the interior angles of a convex polygon there
cannot be more than three acute angles.
What are the missing numbers in the pyramids?
Replace each letter with a digit to make this addition correct.
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 '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. . . .
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?
Toni Beardon has chosen this article introducing a rich area for
practical exploration and discovery in 3D geometry
Caroline and James pick sets of five numbers. Charlie chooses three of them that add together to make a multiple of three. Can they stop him?
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. . . .
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
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.
An article which gives an account of some properties of magic squares.
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?
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.
If you know the sizes of the angles marked with coloured dots in
this diagram which angles can you find by calculation?
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. . . .
Find the area of the annulus in terms of the length of the chord
which is tangent to the inner circle.
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. . . .
Here are three 'tricks' to amaze your friends. But the really
clever trick is explaining to them why these 'tricks' are maths not
magic. Like all good magicians, you should practice by trying. . . .
Consider the equation 1/a + 1/b + 1/c = 1 where a, b and c are
natural numbers and 0 < a < b < c. Prove that there is
only one set of values which satisfy this equation.
There are four children in a family, two girls, Kate and Sally, and
two boys, Tom and Ben. How old are the children?
Can you fit Ls together to make larger versions of themselves?
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.