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. . . .
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.
I want some cubes painted with three blue faces and three red faces. How many different cubes can be painted like that?
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?
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. . . .
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
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?
How many noughts are at the end of these giant numbers?
The tangles created by the twists and turns of the Conway rope
trick are surprisingly symmetrical. Here's why!
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.
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?
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
Prove that if a^2+b^2 is a multiple of 3 then both a and b are multiples of 3.
What can you say about the lengths of the sides of a quadrilateral whose vertices are on a unit circle?
Find the largest integer which divides every member of the
following sequence: 1^5-1, 2^5-2, 3^5-3, ... n^5-n.
Prove that, given any three parallel lines, an equilateral triangle
always exists with one vertex on each of the three lines.
Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2
Prove that if the integer n is divisible by 4 then it can be written as the difference of two squares.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
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 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. . . .
Here the diagram says it all. Can you find the diagram?
Keep constructing triangles in the incircle of the previous triangle. What happens?
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. . . .
An article which gives an account of some properties of magic squares.
Take any two numbers between 0 and 1. Prove that the sum of the
numbers is always less than one plus their product?
Toni Beardon has chosen this article introducing a rich area for
practical exploration and discovery in 3D geometry
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.
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.
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
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?
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.
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.
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.
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.
This is the second article on right-angled triangles whose edge lengths are whole numbers.
Follow the hints and prove Pick's Theorem.
Problem solving is at the heart of the NRICH site. All the problems
give learners opportunities to learn, develop or use mathematical
concepts and skills. Read here for more information.
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.
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.
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 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!
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?
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
With n people anywhere in a field each shoots a water pistol at the
nearest person. In general who gets wet? What difference does it
make if n is odd or even?
Can you work through these direct proofs, using our interactive
Can you invert the logic to prove these statements?
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.