Challenge Level

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

Challenge Level

Find all the ways of placing the numbers 1 to 9 on a W shape, with 3 numbers on each leg, so that each set of 3 numbers has the same total.

A personal investigation of Conway's Rational Tangles. What were the interesting questions that needed to be asked, and where did they lead?

Challenge Level

How many different ways can I lay 10 paving slabs, each 2 foot by 1 foot, to make a path 2 foot wide and 10 foot long from my back door into my garden, without cutting any of the paving slabs?

Challenge Level

Label the joints and legs of these graph theory caterpillars so that the vertex sums are all equal.

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

Challenge Level

A standard die has the numbers 1, 2 and 3 are opposite 6, 5 and 4 respectively so that opposite faces add to 7? If you make standard dice by writing 1, 2, 3, 4, 5, 6 on blank cubes you will find. . . .

Challenge Level

From a group of any 4 students in a class of 30, each has exchanged Christmas cards with the other three. Show that some students have exchanged cards with all the other students in the class. How. . . .

Challenge Level

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

Challenge Level

In how many different ways can I colour the five edges of a pentagon red, blue and green so that no two adjacent edges are the same colour?

Challenge Level

Six points are arranged in space so that no three are collinear. How many line segments can be formed by joining the points in pairs?

Challenge Level

in how many ways can you place the numbers 1, 2, 3 … 9 in the nine regions of the Olympic Emblem (5 overlapping circles) so that the amount in each ring is the same?

Challenge Level

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

Challenge Level

How many ways are there to count 1 - 2 - 3 in the array of triangular numbers? What happens with larger arrays? Can you predict for any size array?

Challenge Level

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

Challenge Level

How many tricolour flags are possible with 5 available colours such that two adjacent stripes must NOT be the same colour. What about 256 colours?

Challenge Level

Imagine you have six different colours of paint. You paint a cube using a different colour for each of the six faces. How many different cubes can be painted using the same set of six colours?

Challenge Level

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

Challenge Level

How many ways can the terms in an ordered list be combined by repeating a single binary operation. Show that for 4 terms there are 5 cases and find the number of cases for 5 terms and 6 terms.

Challenge Level

How many noughts are at the end of these giant numbers?

Challenge Level

To win on a scratch card you have to uncover three numbers that add up to more than fifteen. What is the probability of winning a prize?

Challenge Level

How many ways can you write the word EUROMATHS by starting at the top left hand corner and taking the next letter by stepping one step down or one step to the right in a 5x5 array?

Challenge Level

Suppose you are a bellringer. Can you find the changes so that, starting and ending with a round, all the 24 possible permutations are rung once each and only once?

Some puzzles requiring no knowledge of knot theory, just a careful inspection of the patterns. A glimpse of the classification of knots, prime knots, crossing numbers and knot arithmetic.

Challenge Level

Is it possible to use all 28 dominoes arranging them in squares of four? What patterns can you see in the solution(s)?

Sanjay Joshi, age 17, The Perse Boys School, Cambridge followed up the Madrass College class 2YP article with more thoughts on the problem of the number of ways of expressing an integer as the sum. . . .

Challenge Level

A walk is made up of diagonal steps from left to right, starting at the origin and ending on the x-axis. How many paths are there for 4 steps, for 6 steps, for 8 steps?

Challenge Level

All the words in the Snowman language consist of exactly seven letters formed from the letters {s, no, wm, an). How many words are there in the Snowman language?

Challenge Level

Given a 2 by 2 by 2 skeletal cube with one route `down' the cube. How many routes are there from A to B?

Challenge Level

How many different ways can you arrange the officers in a square?

Class 2YP from Madras College was inspired by the problem in NRICH to work out in how many ways the number 1999 could be expressed as the sum of 3 odd numbers, and this is their solution.

Challenge Level

Your partner chooses two beads and places them side by side behind a screen. What is the minimum number of guesses you would need to be sure of guessing the two beads and their positions?

Challenge Level

Find integer solutions to: $\sqrt{a+b\sqrt{x}} + \sqrt{c+d.\sqrt{x}}=1$

Challenge Level

Libby Jared helped to set up NRICH and this is one of her favourite problems. It's a problem suitable for a wide age range and best tackled practically.

Challenge Level

Chris and Jo put two red and four blue ribbons in a box. They each pick a ribbon from the box without looking. Jo wins if the two ribbons are the same colour. Is the game fair?

An introduction to the binomial coefficient, and exploration of some of the formulae it satisfies.

Challenge Level

Investigate the molecular masses in this sequence of molecules and deduce which molecule has been analysed in the mass spectrometer.