The tangles created by the twists and turns of the Conway rope trick are surprisingly symmetrical. Here's why!
Explore the continued fraction: 2+3/(2+3/(2+3/2+...)) What do you notice when successive terms are taken? What happens to the terms if the fraction goes on indefinitely?
How many tours visit each vertex of a cube once and only once? How many return to the starting point?
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.
An iterative method for finding the value of the Golden Ratio with explanations of how this involves the ratios of Fibonacci numbers and continued fractions.
The problem is how did Archimedes calculate the lengths of the sides of the polygons which needed him to be able to calculate square roots?
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 noughts are at the end of these giant numbers?
Can you find the value of this function involving algebraic fractions for x=2000?
In this article we show that every whole number can be written as a continued fraction of the form k/(1+k/(1+k/...)).
By considering powers of (1+x), show that the sum of the squares of the binomial coefficients from 0 to n is 2nCn
With n people anywhere in a field each shoots a water pistol at the nearest person. In general who gets wet? What difference does it make if n is odd or even?
By proving these particular identities, prove the existence of general cases.
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. . . .
I want some cubes painted with three blue faces and three red faces. How many different cubes can be painted like that?
Draw a 'doodle' - a closed intersecting curve drawn without taking pencil from paper. What can you prove about the intersections?
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.
This article discusses how every Pythagorean triple (a, b, c) can be illustrated by a square and an L shape within another square. You are invited to find some triples for yourself.
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.
An article which gives an account of some properties of magic squares.
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.
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.
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.
Tom writes about expressing numbers as the sums of three squares.
Can you discover whether this is a fair game?
Some diagrammatic 'proofs' of algebraic identities and inequalities.
Peter Zimmerman, a Year 13 student at Mill Hill County High School in Barnet, London wrote this account of modulus arithmetic.
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.
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.
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
Follow the hints and prove Pick's Theorem.
This is the second article on right-angled triangles whose edge lengths are whole numbers.
When if ever do you get the right answer if you add two fractions by adding the numerators and adding the denominators?
The first of two articles on Pythagorean Triples which asks how many right angled triangles can you find with the lengths of each side exactly a whole number measurement. Try it!
A point moves around inside a rectangle. What are the least and the greatest values of the sum of the squares of the distances from the vertices?
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. . . .
We only need 7 numbers for modulus (or clock) arithmetic mod 7 including working with fractions. Explore how to divide numbers and write fractions in modulus arithemtic.
It is impossible to trisect an angle using only ruler and compasses but it can be done using a carpenter's square.
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
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.
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.
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.
Solve this famous unsolved problem and win a prize. Take a positive integer N. If even, divide by 2; if odd, multiply by 3 and add 1. Iterate. Prove that the sequence always goes to 4,2,1,4,2,1...
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.
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?
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.
This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.
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. . . .
Take any two numbers between 0 and 1. Prove that the sum of the numbers is always less than one plus their product?
Have a go at being mathematically negative, by negating these statements.