The tangles created by the twists and turns of the Conway rope
trick are surprisingly symmetrical. Here's why!
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. . . .
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?
In how many distinct ways can six islands be joined by bridges so that each island can be reached from every other island...
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?
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.
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
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.
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. . . .
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.
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. . . .
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. . . .
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.
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. . . .
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. . . .
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?
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. . . .
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.
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. . . .
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.
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?
Here are some examples of 'cons', and see if you can figure out where the trick is.
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.
Replace each letter with a digit to make this addition correct.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
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. . . .
A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
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.
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.
Show that among the interior angles of a convex polygon there
cannot be more than three acute angles.
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 huge wheel is rolling past your window. What do you see?
Start with any triangle T1 and its inscribed circle. Draw the
triangle T2 which has its vertices at the points of contact between
the triangle T1 and its incircle. Now keep repeating this. . . .
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
Toni Beardon has chosen this article introducing a rich area for
practical exploration and discovery in 3D geometry
Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) =
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.
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?
Can you fit Ls together to make larger versions of themselves?
If you know the sizes of the angles marked with coloured dots in
this diagram which angles can you find by calculation?
Is the mean of the squares of two numbers greater than, or less
than, the square of their means?
Find the area of the annulus in terms of the length of the chord
which is tangent to the inner circle.
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. . . .
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?
The diagram shows a regular pentagon with sides of unit length.
Find all the angles in the diagram. Prove that the quadrilateral
shown in red is a rhombus.
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.