The tangles created by the twists and turns of the Conway rope
trick are surprisingly symmetrical. Here's why!
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. . . .
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.
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. . . .
How many tours visit each vertex of a cube once and only once? How
many return to the starting point?
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.
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.
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?
Investigate circuits and record your findings in this simple introduction to truth tables and logic.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
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.
Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2
How many noughts are at the end of these giant numbers?
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.
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. . . .
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. . . .
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
Fractional calculus is a generalisation of ordinary calculus where you can differentiate n times when n is not a whole number.
Toni Beardon has chosen this article introducing a rich area for
practical exploration and discovery in 3D geometry
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. . . .
Can you visualise whether these nets fold up into 3D shapes? Watch the videos each time to see if you were correct.
Can you discover whether this is a fair game?
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. . . .
I want some cubes painted with three blue faces and three red faces. How many different cubes can be painted like that?
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 has. . . .
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
Draw a 'doodle' - a closed intersecting curve drawn without taking pencil from paper. What can you prove about the intersections?
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?
In this article we show that every whole number can be written as a continued fraction of the form k/(1+k/(1+k/...)).
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.
Patterns that repeat in a line are strangely interesting. How many types are there and how do you tell one type from another?
Tom writes about expressing numbers as the sums of three squares.
A introduction to how patterns can be deceiving, and what is and is not a proof.
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.
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.
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.
These proofs are wrong. Can you see why?
Some diagrammatic 'proofs' of algebraic identities and
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.
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.
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?
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.
This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.
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.
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.