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.
When number pyramids have a sequence on the bottom layer, some interesting patterns emerge...
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.
Can you find all the 4-ball shuffles?
Pick a square within a multiplication square and add the numbers on
each diagonal. What do you notice?
Take any two numbers between 0 and 1. Prove that the sum of the
numbers is always less than one plus their product?
A huge wheel is rolling past your window. What do you see?
Can you discover whether this is a fair game?
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.
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.
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.
Can you see how this picture illustrates the formula for the sum of
the first six cube numbers?
Find the missing angle between the two secants to the circle when
the two angles at the centre subtended by the arcs created by the
intersections of the secants and the circle are 50 and 120 degrees.
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. . . .
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.
Pick the number of times a week that you eat chocolate. This number must be more than one but less than ten.
Multiply this number by 2. Add 5 (for Sunday). Multiply by 50... Can you explain why it. . . .
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. . . .
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. . . .
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?
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.
A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
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?
Do you know how to find the area of a triangle? You can count the
squares. What happens if we turn the triangle on end? Press the
button and see. Try counting the number of units in the triangle
now. . . .
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. . . .
An article which gives an account of some properties of magic squares.
Is it true that any convex hexagon will tessellate if it has a pair
of opposite sides that are equal, and three adjacent angles that
add up to 360 degrees?
You have been given nine weights, one of which is slightly heavier
than the rest. Can you work out which weight is heavier in just two
weighings of the balance?
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?
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.
In how many ways can you arrange three dice side by side on a
surface so that the sum of the numbers on each of the four faces
(top, bottom, front and back) is equal?
Choose any two numbers. Call them a and b. Work out the arithmetic mean and the geometric mean. Which is bigger? Repeat for other pairs of numbers. What do you notice?
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.
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
Can you arrange the numbers 1 to 17 in a row so that each adjacent
pair adds up to a square number?
If you take two tests and get a marks out of a maximum b in the first and c marks out of d in the second, does the mediant (a+c)/(b+d)lie between the results for the two tests separately.
Can you make sense of these three proofs of Pythagoras' Theorem?
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. . . .
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 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!
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
Take any whole number q. Calculate q^2 - 1. Factorize
q^2-1 to give two factors a and b (not necessarily q+1 and q-1). Put c = a + b + 2q . Then you will find that ab+1 , bc+1 and ca+1 are all. . . .
Imagine we have four bags containing a large number of 1s, 4s, 7s and 10s. What numbers can we make?
This is the second article on right-angled triangles whose edge lengths are whole numbers.
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?
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.
Is the mean of the squares of two numbers greater than, or less
than, the square of their means?
An iterative method for finding the value of the Golden Ratio with explanations of how this involves the ratios of Fibonacci numbers and continued fractions.