Investigate the number of points with integer coordinates on circles with centres at the origin for which the square of the radius is a power of 5.

Prove that the shaded area of the semicircle is equal to the area of the inner circle.

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. . . .

Investigate circuits and record your findings in this simple introduction to truth tables and logic.

Can you visualise whether these nets fold up into 3D shapes? Watch the videos each time to see if you were correct.

Sort these mathematical propositions into a series of 8 correct statements.

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.

This shape comprises four semi-circles. What is the relationship between the area of the shaded region and the area of the circle on AB as diameter?

An inequality involving integrals of squares of functions.

Take any rectangle ABCD such that AB > BC. The point P is on AB and Q is on CD. Show that there is exactly one position of P and Q such that APCQ is a rhombus.

What happens to the perimeter of triangle ABC as the two smaller circles change size and roll around inside the bigger circle?

Three equilateral triangles ABC, AYX and XZB are drawn with the point X a moveable point on AB. The points P, Q and R are the centres of the three triangles. What can you say about triangle PQR?

It is obvious that we can fit four circles of diameter 1 unit in a square of side 2 without overlapping. What is the smallest square into which we can fit 3 circles of diameter 1 unit?

Can you make sense of these three proofs of Pythagoras' Theorem?

Generalise the sum of a GP by using derivatives to make the coefficients into powers of the natural numbers.

Fractional calculus is a generalisation of ordinary calculus where you can differentiate n times when n is not a whole number.

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?

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. . . .

This is the second article on right-angled triangles whose edge lengths are whole numbers.

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!

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. . . .

A point moves around inside a rectangle. What are the least and the greatest values of the sum of the squares of the distances from the vertices?

Can you make sense of the three methods to work out the area of the kite in the square?

We continue the discussion given in Euclid's Algorithm I, and here we shall discover when an equation of the form ax+by=c has no solutions, and when it has infinitely many solutions.

When if ever do you get the right answer if you add two fractions by adding the numerators and adding the denominators?

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 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 convince me of each of the following: If a square number is multiplied by a square number the product is ALWAYS a square number...

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.

In this article we show that every whole number can be written as a continued fraction of the form k/(1+k/(1+k/...)).

This follows up the 'magic Squares for Special Occasions' article which tells you you to create a 4by4 magicsquare with a special date on the top line using no negative numbers and no repeats.

Here is a proof of Euler's formula in the plane and on a sphere together with projects to explore cases of the formula for a polygon with holes, for the torus and other solids with holes and the. . . .

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?

An article which gives an account of some properties of magic squares.

This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.

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. . . .

Solve this famous unsolved problem and win a prize. Take a positive integer N. If even, divide by 2; if odd, multiply by 3 and add 1. Iterate. Prove that the sequence always goes to 4,2,1,4,2,1...

Take a complicated fraction with the product of five quartics top and bottom and reduce this to a whole number. This is a numerical example involving some clever algebra.

Take a number, add its digits then multiply the digits together, then multiply these two results. If you get the same number it is an SP number.

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.

The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.

Peter Zimmerman from Mill Hill County High School in Barnet, London gives a neat proof that: 5^(2n+1) + 11^(2n+1) + 17^(2n+1) is divisible by 33 for every non negative integer n.

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.

Suppose A always beats B and B always beats C, then would you expect A to beat C? Not always! What seems obvious is not always true. Results always need to be proved in mathematics.