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. . . .
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 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.
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.
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?
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.
The tangles created by the twists and turns of the Conway rope
trick are surprisingly symmetrical. Here's why!
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
Can you rearrange the cards to make a series of correct
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?
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. . . .
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.
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. . . .
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.
A quadrilateral inscribed in a unit circle has sides of lengths s1, s2, s3 and s4 where s1 ≤ s2 ≤ s3 ≤ s4.
Find a quadrilateral of this type for which s1= sqrt2 and show s1 cannot. . . .
In how many distinct ways can six islands be joined by bridges so that each island can be reached from every other island...
Prove that, given any three parallel lines, an equilateral triangle
always exists with one vertex on each of the three lines.
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 the area of the annulus in terms of the length of the chord
which is tangent to the inner circle.
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.
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. . . .
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.
If you know the sizes of the angles marked with coloured dots in
this diagram which angles can you find by calculation?
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. . . .
The first of two articles on Pythagorean Triples which asks how many right angled triangles can you find with the lengths of each side exactly a whole number measurement. Try it!
This is the second article on right-angled triangles whose edge lengths are whole numbers.
Janine noticed, while studying some cube numbers, that if you take
three consecutive whole numbers and multiply them together and then
add the middle number of the three, you get the middle number. . . .
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
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.
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.
If you think that mathematical proof is really clearcut and
universal then you should read this article.
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.
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. . . .
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.
Take any two numbers between 0 and 1. Prove that the sum of the
numbers is always less than one plus their product?
Which of these roads will satisfy a Munchkin builder?
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?
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. . . .
Here are some examples of 'cons', and see if you can figure out where the trick is.
Six points are arranged in space so that no three are collinear.
How many line segments can be formed by joining the points in
L triominoes can fit together to make larger versions of
themselves. Is every size possible to make in this way?
Four identical right angled triangles are drawn on the sides of a
square. Two face out, two face in. Why do the four vertices marked
with dots lie on one line?
There are 12 identical looking coins, one of which is a fake. The
counterfeit coin is of a different weight to the rest. What is the
minimum number of weighings needed to locate the fake coin?
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. . . .
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?