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. . . .
Can you see how this picture illustrates the formula for the sum of
the first six cube numbers?
Can you visualise whether these nets fold up into 3D shapes? Watch the videos each time to see if you were correct.
Toni Beardon has chosen this article introducing a rich area for
practical exploration and discovery in 3D geometry
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. . . .
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.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
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
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.
A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
The tangles created by the twists and turns of the Conway rope
trick are surprisingly symmetrical. Here's why!
The Tower of Hanoi is an ancient mathematical challenge. Working on the building blocks may help you to explain the patterns you notice.
Can you use the diagram to prove the AM-GM inequality?
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 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.
Three dice are placed in a row. Find a way to turn each one so that the three numbers on top of the dice total the same as the three numbers on the front of the dice. Can you find all the ways to do. . . .
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.
When number pyramids have a sequence on the bottom layer, some interesting patterns emerge...
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. . . .
Some diagrammatic 'proofs' of algebraic identities and
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.
A blue coin rolls round two yellow coins which touch. The coins are
the same size. How many revolutions does the blue coin make when it
rolls all the way round the yellow coins? Investigate for a. . . .
Prove Pythagoras' Theorem using enlargements and scale factors.
Explain why, when moving heavy objects on rollers, the object moves
twice as fast as the rollers. Try a similar experiment yourself.
What happens to the perimeter of triangle ABC as the two smaller
circles change size and roll around inside the bigger circle?
Three equilateral triangles ABC, AYX and XZB are drawn with the
point X a moveable point on AB. The points P, Q and R are the
centres of the three triangles. What can you say about triangle
Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2
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. . . .
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. . . .
How many tours visit each vertex of a cube once and only once? How
many return to the starting point?
We are given a regular icosahedron having three red vertices. Show
that it has a vertex that has at least two red neighbours.
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. . . .
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. . . .
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.
Can you work through these direct proofs, using our interactive
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
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?
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?
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
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.
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.
Fractional calculus is a generalisation of ordinary calculus where you can differentiate n times when n is not a whole number.
If I tell you two sides of a right-angled triangle, you can easily work out the third. But what if the angle between the two sides is not a right angle?
If you take two tests and get a marks out of a maximum b in the first and c marks out of d in the second, does the mediant (a+c)/(b+d)lie between the results for the two tests separately.
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
Investigate the number of points with integer coordinates on
circles with centres at the origin for which the square of the
radius is a power of 5.
Imagine two identical cylindrical pipes meeting at right angles and think about the shape of the space which belongs to both pipes. Early Chinese mathematicians call this shape the mouhefanggai.