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. . . .
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. . . .
The tangles created by the twists and turns of the Conway rope
trick are surprisingly symmetrical. Here's why!
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 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. . . .
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. . . .
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. . . .
If you think that mathematical proof is really clearcut and
universal then you should read this article.
Here are some examples of 'cons', and see if you can figure out where the trick is.
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
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.
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 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.
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. . . .
We have exactly 100 coins. There are five different values of
coins. We have decided to buy a piece of computer software for
39.75. We have the correct money, not a penny more, not a penny
less! Can. . . .
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.
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?
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.
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. . . .
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. . . .
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. . . .
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.
What does logic mean to us and is that different to mathematical logic? We will explore these questions in this article.
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.
Take any two numbers between 0 and 1. Prove that the sum of the
numbers is always less than one plus their product?
Prove that, given any three parallel lines, an equilateral triangle
always exists with one vertex on each of the three lines.
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.
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?
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?
What are the missing numbers in the pyramids?
L triominoes can fit together to make larger versions of
themselves. Is every size possible to make in this way?
Clearly if a, b and c are the lengths of the sides of a triangle and the triangle is equilateral then
a^2 + b^2 + c^2 = ab + bc + ca. Is the converse true, and if so can you prove it? That is if. . . .
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
Can you fit Ls together to make larger versions of themselves?
Eight children enter the autumn cross-country race at school. How
many possible ways could they come in at first, second and third
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.
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.
An article which gives an account of some properties of magic squares.
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?
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.
If you know the sizes of the angles marked with coloured dots in
this diagram which angles can you find by calculation?
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. . . .
Can you rearrange the cards to make a series of correct
What can you say about the angles on opposite vertices of any
cyclic quadrilateral? Working on the building blocks will give you
insights that may help you to explain what is special about them.
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?