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. . . .
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?
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.
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.
Can you visualise whether these nets fold up into 3D shapes? Watch the videos each time to see if you were correct.
There are four children in a family, two girls, Kate and Sally, and
two boys, Tom and Ben. How old are the children?
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. . . .
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. . . .
What happens to the perimeter of triangle ABC as the two smaller
circles change size and roll around inside the bigger circle?
Can you use the diagram to prove the AM-GM inequality?
A, B & C own a half, a third and a sixth of a coin collection.
Each grab some coins, return some, then share equally what they had
put back, finishing with their own share. How rich are they?
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. . . .
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. . . .
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. . . .
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.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
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. . . .
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. . . .
Can you see how this picture illustrates the formula for the sum of
the first six cube numbers?
Four jewellers possessing respectively eight rubies, ten saphires,
a hundred pearls and five diamonds, presented, each from his own
stock, one apiece to the rest in token of regard; and they. . . .
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. . . .
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. . . .
I am exactly n times my daughter's age. In m years I shall be exactly (n-1) times her age. In m2 years I shall be exactly (n-2) times her age. After that I shall never again be an exact multiple of. . . .
We are given a regular icosahedron having three red vertices. Show
that it has a vertex that has at least two red neighbours.
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
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 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?
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. . . .
Can you discover whether this is a fair game?
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. . . .
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?
In how many distinct ways can six islands be joined by bridges so that each island can be reached from every other island...
The final of five articles which containe the proof of why the sequence introduced in article IV either reaches the fixed point 0 or the sequence enters a repeating cycle of four values.
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.
Patterns that repeat in a line are strangely interesting. How many types are there and how do you tell one type from another?
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 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.
An article which gives an account of some properties of magic squares.
This article discusses how every Pythagorean triple (a, b, c) can be illustrated by a square and an L shape within another square. You are invited to find some triples for yourself.
Toni Beardon has chosen this article introducing a rich area for
practical exploration and discovery in 3D geometry
Take any prime number greater than 3 , square it and subtract one.
Working on the building blocks will help you to explain what is
special about your results.
Show that if three prime numbers, all greater than 3, form an
arithmetic progression then the common difference is divisible by
6. What if one of the terms is 3?
Show that if you add 1 to the product of four consecutive numbers
the answer is ALWAYS a perfect square.
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. . . .
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
The largest square which fits into a circle is ABCD and EFGH is a square with G and H on the line CD and E and F on the circumference of the circle. Show that AB = 5EF.
Similarly the largest. . . .
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. . . .
It is impossible to trisect an angle using only ruler and compasses
but it can be done using a carpenter's square.