Prove that if a^2+b^2 is a multiple of 3 then both a and b are multiples of 3.
Imagine we have four bags containing numbers from a sequence. What numbers can we make now?
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. . . .
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?
Imagine we have four bags containing a large number of 1s, 4s, 7s and 10s. What numbers can we make?
How many pairs of numbers can you find that add up to a multiple of
11? Do you notice anything interesting about your results?
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.
In how many distinct ways can six islands be joined by bridges so that each island can be reached from every other island...
Make a set of numbers that use all the digits from 1 to 9, once and
once only. Add them up. The result is divisible by 9. Add each of
the digits in the new number. What is their sum? Now try some. . . .
There are four children in a family, two girls, Kate and Sally, and
two boys, Tom and Ben. How old are the children?
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.
Pick a square within a multiplication square and add the numbers on
each diagonal. What do you notice?
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. . . .
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?
Here are some examples of 'cons', and see if you can figure out where the trick is.
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. . . .
You can work out the number someone else is thinking of as follows. Ask a friend to think of any natural number less than 100. Then ask them to tell you the remainders when this number is divided by. . . .
Find some triples of whole numbers a, b and c such that a^2 + b^2 + c^2 is a multiple of 4. Is it necessarily the case that a, b and c must all be even? If so, can you explain why?
Can you rearrange the cards to make a series of correct
If you know the sizes of the angles marked with coloured dots in
this diagram which angles can you find by calculation?
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?
Take any two digit number, for example 58. What do you have to do to reverse the order of the digits? Can you find a rule for reversing the order of digits for any two digit number?
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.
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.
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. . . .
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.
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. . . .
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. . . .
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?
Can you fit Ls together to make larger versions of themselves?
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
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?
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.
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 serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
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. . . .
Six points are arranged in space so that no three are collinear.
How many line segments can be formed by joining the points in
Nine cross country runners compete in a team competition in which
there are three matches. If you were a judge how would you decide
who would win?
From a group of any 4 students in a class of 30, each has exchanged
Christmas cards with the other three. Show that some students have
exchanged cards with all the other students in the class. How. . . .
The tangles created by the twists and turns of the Conway rope
trick are surprisingly symmetrical. Here's why!
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. . . .
I start with a red, a green and a blue marble. I can trade any of my marbles for two others, one of each colour. Can I end up with five more blue marbles than red after a number of such trades?
I start with a red, a blue, a green and a yellow marble. I can
trade any of my marbles for three others, one of each colour. Can I
end up with exactly two marbles of each colour?
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
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?
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.
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. . . .
A huge wheel is rolling past your window. What do you see?
What happens to the perimeter of triangle ABC as the two smaller
circles change size and roll around inside the bigger circle?