Can you discover whether this is a fair game?
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. . . .
The picture illustrates the sum 1 + 2 + 3 + 4 = (4 x 5)/2. Prove the general formula for the sum of the first n natural numbers and the formula for the sum of the cubes of the first n natural. . . .
Some diagrammatic 'proofs' of algebraic identities and
What happens to the perimeter of triangle ABC as the two smaller
circles change size and roll around inside the bigger circle?
How many tours visit each vertex of a cube once and only once? How
many return to the starting point?
Mark a point P inside a closed curve. Is it always possible to find
two points that lie on the curve, such that P is the mid point of
the line joining these two points?
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
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. . . .
Can you see how this picture illustrates the formula for the sum of
the first six cube numbers?
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.
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.
Some puzzles requiring no knowledge of knot theory, just a careful
inspection of the patterns. A glimpse of the classification of
knots and a little about prime knots, crossing numbers and. . . .
An article about the strategy for playing The Triangle Game which
appears on the NRICH site. It contains a simple lemma about
labelling a grid of equilateral triangles within a triangular
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.
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.
Here the diagram says it all. Can you find the diagram?
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. . . .
Choose any two numbers. Call them a and b. Work out the arithmetic mean and the geometric mean. Which is bigger? Repeat for other pairs of numbers. What do you notice?
The tangles created by the twists and turns of the Conway rope
trick are surprisingly symmetrical. Here's why!
A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
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.
Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2
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. . . .
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.
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?
Show that x = 1 is a solution of the equation x^(3/2) - 8x^(-3/2) = 7 and find all other solutions.
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
Three frogs hopped onto the table. A red frog on the left a green in the middle and a blue frog on the right. Then frogs started jumping randomly over any adjacent frog. Is it possible for them to. . . .
When number pyramids have a sequence on the bottom layer, some interesting patterns emerge...
Factorial one hundred (written 100!) has 24 noughts when written in full and that 1000! has 249 noughts? Convince yourself that the above is true. Perhaps your methodology will help you find the. . . .
This is an interactivity in which you have to sort the steps in the
completion of the square into the correct order to prove the
formula for the solutions of quadratic equations.
Use this interactivity to sort out the steps of the proof of the formula for the sum of an arithmetic series. The 'thermometer' will tell you how you are doing
We are given a regular icosahedron having three red vertices. Show
that it has a vertex that has at least two red neighbours.
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.
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?
These proofs are wrong. Can you see why?
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
How many different cubes can be painted with three blue faces and
three red faces? A boy (using blue) and a girl (using red) paint
the faces of a cube in turn so that the six faces are painted. . . .
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. . . .
A 'doodle' is a closed intersecting curve drawn without taking
pencil from paper. Only two lines cross at each intersection or
vertex (never 3), that is the vertex points must be 'double points'
not. . . .
Can you work through these direct proofs, using our interactive
Can you rearrange the cards to make a series of correct
When if ever do you get the right answer if you add two fractions
by adding the numerators and adding the denominators?
A introduction to how patterns can be deceiving, and what is and is not a proof.
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 orf two or more cubes.
Peter Zimmerman, a Year 13 student at Mill Hill County High School
in Barnet, London wrote this account of modulus arithmetic.
Tom writes about expressing numbers as the sums of three squares.
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.
Follow the hints and prove Pick's Theorem.