Some diagrammatic 'proofs' of algebraic identities and
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 discover whether this is a fair game?
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. . . .
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?
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 see how this picture illustrates the formula for the sum of
the first six cube numbers?
Choose any two numbers. Call them a and b. Work out the arithmetic mean and the geometric mean. Which is bigger? Repeat for other pairs of numbers. What do you notice?
Show that for natural numbers x and y if x/y > 1 then x/y>(x+1)/(y+1}>1. Hence prove that the product for i=1 to n of [(2i)/(2i-1)] tends to infinity as n tends to infinity.
By considering powers of (1+x), show that the sum of the squares of
the binomial coefficients from 0 to n is 2nCn
What happens to the perimeter of triangle ABC as the two smaller
circles change size and roll around inside the bigger circle?
Can you rearrange the cards to make a series of correct
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.
By proving these particular identities, prove the existence of general cases.
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
A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
These proofs are wrong. Can you see why?
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.
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. . . .
This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.
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 article which gives an account of some properties of magic squares.
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 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.
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.
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
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 first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
Show that if you add 1 to the product of four consecutive numbers
the answer is ALWAYS a perfect square.
To find the integral of a polynomial, evaluate it at some special
points and add multiples of these values.
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.
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?
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.
Show that if three prime numbers, all greater than 3, form an
arithmetic progression then the common difference is divisible by
6. What if one of the terms is 3?
Show that x = 1 is a solution of the equation x^(3/2) - 8x^(-3/2) = 7 and find all other solutions.
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. . . .
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!
It is impossible to trisect an angle using only ruler and compasses
but it can be done using a carpenter's square.
Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) = 1.
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.
Peter Zimmerman, a Year 13 student at Mill Hill County High School
in Barnet, London wrote this account of modulus arithmetic.
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.
What fractions can you divide the diagonal of a square into by simple folding?
Can you make sense of these three proofs of Pythagoras' Theorem?
Have a go at being mathematically negative, by negating these