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

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

A composite number is one that is neither prime nor 1. Show that 10201 is composite in any base.

Explore a number pattern which has the same symmetries in different bases.

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

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

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.

Show that the infinite set of finite (or terminating) binary sequences can be written as an ordered list whereas the infinite set of all infinite binary sequences cannot.

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

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

This is an interactivity in which you have to sort into the correct order the steps in the proof of the formula for the sum of a geometric series.

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

Freddie Manners, of Packwood Haugh School in Shropshire solved an alphanumeric without using the extra information supplied and this article explains his reasoning.

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

Take any pair of two digit numbers x=ab and y=cd where, without loss of generality, ab > cd . Form two 4 digit numbers r=abcd and s=cdab and calculate: {r^2 - s^2} /{x^2 - y^2}.

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

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?

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.

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

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.

If a two digit number has its digits reversed and the smaller of the two numbers is subtracted from the larger, prove the difference can never be prime.

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

Keep constructing triangles in the incircle of the previous triangle. What happens?

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

Explore what happens when you draw graphs of quadratic equations with coefficients based on a geometric sequence.

Patterns that repeat in a line are strangely interesting. How many types are there and how do you tell one type from another?

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

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.

The twelve edge totals of a standard six-sided die are distributed symmetrically. Will the same symmetry emerge with a dodecahedral die?

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

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.

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?

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

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.

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

Given a set of points (x,y) with distinct x values, find a polynomial that goes through all of them, then prove some results about the existence and uniqueness of these polynomials.

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

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

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.

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

By proving these particular identities, prove the existence of general cases.

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.

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.

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?