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.
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...
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.
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.
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. . . .
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 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.
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
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. . . .
Take any two numbers between 0 and 1. Prove that the sum of the
numbers is always less than one plus their product?
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. . . .
Here the diagram says it all. Can you find the diagram?
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
The nth term of a sequence is given by the formula n^3 + 11n . Find
the first four terms of the sequence given by this formula and the
first term of the sequence which is bigger than one million. . . .
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 serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
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
Prove that, given any three parallel lines, an equilateral triangle
always exists with one vertex on each of the three lines.
Janine noticed, while studying some cube numbers, that if you take
three consecutive whole numbers and multiply them together and then
add the middle number of the three, you get the middle number. . . .
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.
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. . . .
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.
Start with any triangle T1 and its inscribed circle. Draw the
triangle T2 which has its vertices at the points of contact between
the triangle T1 and its incircle. Now keep repeating this. . . .
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.
By considering powers of (1+x), show that the sum of the squares of
the binomial coefficients from 0 to n is 2nCn
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. . . .
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.
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?
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.
An article which gives an account of some properties of magic squares.
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.
Peter Zimmerman, a Year 13 student at Mill Hill County High School
in Barnet, London wrote this account of modulus arithmetic.
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. . . .
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. . . .
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. . . .
When if ever do you get the right answer if you add two fractions
by adding the numerators and adding the denominators?
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. . . .
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.
Which of these roads will satisfy a Munchkin builder?
This problem is a sequence of linked mini-challenges leading up to the proof of a difficult final challenge, encouraging you to think mathematically. Starting with one of the mini-challenges, how. . . .
Can you work out where the blue-and-red brick roads end?
This is the second article on right-angled triangles whose edge lengths are whole numbers.
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?
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 introduction to how patterns can be deceiving, and what is and is not a proof.
These proofs are wrong. Can you see why?
Follow the hints and prove Pick's Theorem.