The tangles created by the twists and turns of the Conway rope trick are surprisingly symmetrical. Here's why!

Prove that you cannot form a Magic W with a total of 12 or less or with a with a total of 18 or more.

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 tours visit each vertex of a cube once and only once? How many return to the starting point?

Draw a 'doodle' - a closed intersecting curve drawn without taking pencil from paper. What can you prove about the intersections?

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?

Pick a square within a multiplication square and add the numbers on each diagonal. What do you notice?

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.

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.

Can you rearrange the cards to make a series of correct mathematical statements?

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

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.

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

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

A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.

Learn about the link between logical arguments and electronic circuits. Investigate the logical connectives by making and testing your own circuits and record your findings in truth tables.

Toni Beardon has chosen this article introducing a rich area for practical exploration and discovery in 3D geometry

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.

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

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.

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.

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.

Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.

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

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

Find all positive integers a and b for which the two equations: x^2-ax+b = 0 and x^2-bx+a = 0 both have positive integer solutions.

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

Can you explain why a sequence of operations always gives you perfect squares?

Show that for natural numbers x and y if x/y > 1 then x/y>(x+1)/(y+1}>1. Hence prove that the product for i=1 to n of [(2i)/(2i-1)] tends to infinity as n tends to infinity.

L triominoes can fit together to make larger versions of themselves. Is every size possible to make in this way?

Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.

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.

Given that a, b and c are natural numbers show that if sqrt a+sqrt b is rational then it is a natural number. Extend this to 3 variables.

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

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

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.

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 problem is a sequence of linked mini-challenges leading up to the proof of a difficult final challenge, encouraging you to think mathematically. Starting with one of the mini-challenges, how. . . .

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

I want some cubes painted with three blue faces and three red faces. How many different cubes can be painted like that?

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.

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

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