The tangles created by the twists and turns of the Conway rope
trick are surprisingly symmetrical. Here's why!
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 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. . . .
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. . . .
How many tours visit each vertex of a cube once and only once? How
many return to the starting 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.
Some diagrammatic 'proofs' of algebraic identities and
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. . . .
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 visualise whether these nets fold up into 3D shapes? Watch the videos each time to see if you were correct.
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.
Explain why, when moving heavy objects on rollers, the object moves
twice as fast as the rollers. Try a similar experiment yourself.
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. . . .
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
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?
Learn about the link between logical arguments and electronic circuits. Investigate the logical connectives by making and testing your own circuits and record your findings in truth tables.
What happens to the perimeter of triangle ABC as the two smaller
circles change size and roll around inside the bigger circle?
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. . . .
Learn about the link between logical arguments and electronic circuits. Investigate the logical connectives by making and testing your own circuits and fill in the blanks in truth tables to record. . . .
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. . . .
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
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.
Fractional calculus is a generalisation of ordinary calculus where you can differentiate n times when n is not a whole number.
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. . . .
Can you use the diagram to prove the AM-GM inequality?
Toni Beardon has chosen this article introducing a rich area for
practical exploration and discovery in 3D geometry
Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2
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. . . .
We are given a regular icosahedron having three red vertices. Show
that it has a vertex that has at least two red neighbours.
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.
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. . . .
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?
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?
Investigate circuits and record your findings in this simple introduction to truth tables and logic.
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. . . .
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.
A introduction to how patterns can be deceiving, and what is and is not a proof.
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.
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.
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.
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.
The twelve edge totals of a standard six-sided die are distributed symmetrically. Will the same symmetry emerge with a dodecahedral die?