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...
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.
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.
An introduction to some beautiful results of Number Theory
Here the diagram says it all. Can you find the diagram?
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?
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.
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
When if ever do you get the right answer if you add two fractions by adding the numerators and adding the denominators?
Pick a square within a multiplication square and add the numbers on each diagonal. What do you notice?
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?
Can you rearrange the cards to make a series of correct mathematical statements?
An inequality involving integrals of squares of functions.
Can you find the areas of the trapezia in this sequence?
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.
Peter Zimmerman, a Year 13 student at Mill Hill County High School in Barnet, London wrote this account of modulus arithmetic.
An article which gives an account of some properties of magic squares.
A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
Can you work through these direct proofs, using our interactive proof sorters?
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
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 frame.
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.
Sort these mathematical propositions into a series of 8 correct statements.
These proofs are wrong. Can you see why?
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.
Clearly if a, b and c are the lengths of the sides of an equilateral triangle then a^2 + b^2 + c^2 = ab + bc + ca. Is the converse true?
Can you invert the logic to prove these statements?
Given that a, b and c are natural numbers show that if sqrt a+sqrt b is rational then it is a natural number. Extend this to 3 variables.
L triominoes can fit together to make larger versions of themselves. Is every size possible to make in this way?
Prove that in every tetrahedron there is a vertex such that the three edges meeting there have lengths which could be the sides of a triangle.
What can you say about the lengths of the sides of a quadrilateral whose vertices are on a unit circle?
Which of these roads will satisfy a Munchkin builder?
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?
Follow the hints and prove Pick's Theorem.
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. . . .
Show that if you add 1 to the product of four consecutive numbers the answer is ALWAYS a perfect square.
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 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.
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.
To find the integral of a polynomial, evaluate it at some special points and add multiples of these values.
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. . . .
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.
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.
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!
This is the second article on right-angled triangles whose edge lengths are whole 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.
This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.
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?
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.