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.

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

An account of methods for finding whether or not a number can be written as the sum of two or more squares or as the sum of two or more cubes.

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.

Find the smallest positive integer N such that N/2 is a perfect cube, N/3 is a perfect fifth power and N/5 is a perfect seventh power.

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

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.

Prove that if a^2+b^2 is a multiple of 3 then both a and b are multiples of 3.

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

Take any prime number greater than 3 , square it and subtract one. Working on the building blocks will help you to explain what is special about your results.

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

How many tours visit each vertex of a cube once and only once? How many return to the starting point?

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

Caroline and James pick sets of five numbers. Charlie chooses three of them that add together to make a multiple of three. Can they stop him?

A polite number can be written as the sum of two or more consecutive positive integers. Find the consecutive sums giving the polite numbers 544 and 424. What characterizes impolite numbers?

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

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

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.

To find the integral of a polynomial, evaluate it at some special points and add multiples of these values.

Can you work through these direct proofs, using our interactive proof sorters?

We only need 7 numbers for modulus (or clock) arithmetic mod 7 including working with fractions. Explore how to divide numbers and write fractions in modulus arithemtic.

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?

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

Have a go at being mathematically negative, by negating these statements.

The sum of any two of the numbers 2, 34 and 47 is a perfect square. Choose three square numbers and find sets of three integers with this property. Generalise to four integers.

Find the largest integer which divides every member of the following sequence: 1^5-1, 2^5-2, 3^5-3, ... n^5-n.

What can you say about the lengths of the sides of a quadrilateral whose vertices are on a unit circle?

By considering powers of (1+x), show that the sum of the squares of the binomial coefficients from 0 to n is 2nCn

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

Which is the biggest and which the smallest of $2000^{2002}, 2001^{2001} \text{and } 2002^{2000}$?

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

What can you say about the common difference of an AP where every term is prime?

The nth term of a sequence is given by the formula n^3 + 11n . Find the first four terms of the sequence given by this formula and the first term of the sequence which is bigger than one million. . . .

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

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.

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

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

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

Prove that, given any three parallel lines, an equilateral triangle always exists with one vertex on each of the three lines.

Take any two numbers between 0 and 1. Prove that the sum of the numbers is always less than one plus their product?

The sums of the squares of three related numbers is also a perfect square - can you explain why?

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

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.