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...
Investigate the sequences obtained by starting with any positive 2
digit number (10a+b) and repeatedly using the rule 10a+b maps to
10b-a to get the next number in the sequence.
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.
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.
Take any whole number q. Calculate q^2 - 1. Factorize
q^2-1 to give two factors a and b (not necessarily q+1 and q-1). Put c = a + b + 2q . Then you will find that ab+1 , bc+1 and ca+1 are all. . . .
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 iterative method for finding the value of the Golden Ratio with explanations of how this involves the ratios of Fibonacci numbers and continued fractions.
In this article we show that every whole number can be written as a continued fraction of the form k/(1+k/(1+k/...)).
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.
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?
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
A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
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.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
Here the diagram says it all. Can you find the diagram?
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
Take any two numbers between 0 and 1. Prove that the sum of the
numbers is always less than one plus their product?
Some diagrammatic 'proofs' of algebraic identities and
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.
Tom writes about expressing numbers as the sums of three squares.
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.
By considering powers of (1+x), show that the sum of the squares of
the binomial coefficients from 0 to n is 2nCn
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.
Can you see how this picture illustrates the formula for the sum of
the first six cube numbers?
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?
A quadrilateral inscribed in a unit circle has sides of lengths s1, s2, s3 and s4 where s1 ≤ s2 ≤ s3 ≤ s4.
Find a quadrilateral of this type for which s1= sqrt2 and show s1 cannot. . . .
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?
Peter Zimmerman, a Year 13 student at Mill Hill County High School
in Barnet, London wrote this account of modulus arithmetic.
I am exactly n times my daughter's age. In m years I shall be exactly (n-1) times her age. In m2 years I shall be exactly (n-2) times her age. After that I shall never again be an exact multiple of. . . .
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.
An article which gives an account of some properties of magic squares.
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?
Euler found four whole numbers such that the sum of any two of the
numbers is a perfect square. Three of the numbers that he found are
a = 18530, b=65570, c=45986. Find the fourth number, x. You. . . .
L triominoes can fit together to make larger versions of
themselves. Is every size possible to make in this way?
Clearly if a, b and c are the lengths of the sides of a triangle and the triangle is equilateral then
a^2 + b^2 + c^2 = ab + bc + ca. Is the converse true, and if so can you prove it? That is if. . . .
Explore a number pattern which has the same symmetries in different bases.
Prove that in every tetrahedron there is a vertex such that the
three edges meeting there have lengths which could be the sides of
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.
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?
When if ever do you get the right answer if you add two fractions
by adding the numerators and adding the denominators?
Follow the hints and prove Pick's Theorem.
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!
If I tell you two sides of a right-angled triangle, you can easily work out the third. But what if the angle between the two sides is not a right angle?
This is the second article on right-angled triangles whose edge lengths are whole numbers.
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
These proofs are wrong. Can you see why?
Which of these roads will satisfy a Munchkin builder?
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. . . .