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. . . .
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.
Can you see how this picture illustrates the formula for the sum of
the first six cube numbers?
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. . . .
The tangles created by the twists and turns of the Conway rope
trick are surprisingly symmetrical. Here's why!
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?
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. . . .
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. . . .
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. . . .
Can you discover whether this is a fair game?
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.
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. . . .
How many tours visit each vertex of a cube once and only once? How
many return to the starting point?
Prove that if the integer n is divisible by 4 then it can be written as the difference of two squares.
A, B & C own a half, a third and a sixth of a coin collection.
Each grab some coins, return some, then share equally what they had
put back, finishing with their own share. How rich are they?
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. . . .
What happens to the perimeter of triangle ABC as the two smaller
circles change size and roll around inside the bigger circle?
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. . . .
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. . . .
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.
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. . . .
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
A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
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. . . .
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?
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
We are given a regular icosahedron having three red vertices. Show
that it has a vertex that has at least two red neighbours.
Find all positive integers a and b for which the two equations:
x^2-ax+b = 0 and x^2-bx+a = 0 both have positive integer solutions.
The sum of any two of the numbers 2, 34 and 47 is a perfect square.
Choose three square numbers and find sets of three integers with
this property. Generalise to four integers.
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?
Prove that if a^2+b^2 is a multiple of 3 then both a and b are multiples of 3.
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. . . .
Find the largest integer which divides every member of the
following sequence: 1^5-1, 2^5-2, 3^5-3, ... n^5-n.
Imagine we have four bags containing numbers from a sequence. What numbers can we make now?
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
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.
Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2
Four jewellers possessing respectively eight rubies, ten saphires,
a hundred pearls and five diamonds, presented, each from his own
stock, one apiece to the rest in token of regard; and they. . . .
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?
Explain why, when moving heavy objects on rollers, the object moves
twice as fast as the rollers. Try a similar experiment yourself.
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
Toni Beardon has chosen this article introducing a rich area for
practical exploration and discovery in 3D geometry
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.
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.
Which of these roads will satisfy a Munchkin builder?
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.
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
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. . . .
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.