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...
Given that u>0 and v>0 find the smallest possible value of
1/u + 1/v given that u + v = 5 by different methods.
Given any two polynomials in a single variable it is always
possible to eliminate the variable and obtain a formula showing the
relationship between the two polynomials. Try this one.
If x + y = -1 find the largest value of xy by coordinate geometry, by calculus and by algebra.
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. . . .
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.
Find all the solutions to the this equation.
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?
If for any triangle ABC tan(A - B) + tan(B - C) + tan(C - A) = 0
what can you say about the triangle?
In this article we show that every whole number can be written as a continued fraction of the form k/(1+k/(1+k/...)).
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.
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
Some diagrammatic 'proofs' of algebraic identities and
Fractional calculus is a generalisation of ordinary calculus where you can differentiate n times when n is not a whole number.
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.
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.
Can you discover whether this is a fair game?
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.
A composite number is one that is neither prime nor 1. Show that
10201 is composite in any base.
Take any rectangle ABCD such that AB > BC. The point P is on AB
and Q is on CD. Show that there is exactly one position of P and Q
such that APCQ is a rhombus.
The diagram shows a regular pentagon with sides of unit length.
Find all the angles in the diagram. Prove that the quadrilateral
shown in red is a rhombus.
Prove Pythagoras Theorem using enlargements and scale factors.
ABCD is a square. P is the midpoint of AB and is joined to C. A line from D perpendicular to PC meets the line at the point Q. Prove AQ = AD.
Investigate the number of points with integer coordinates on
circles with centres at the origin for which the square of the
radius is a power of 5.
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.
If you take two tests and get a marks out of a maximum b in the first and c marks out of d in the second, does the mediant (a+c)/(b+d)lie between the results for the two tests separately.
Can you convince me of each of the following: If a square number is
multiplied by a square number the product is ALWAYS a square
Here is a proof of Euler's formula in the plane and on a sphere together with projects to explore cases of the formula for a polygon with holes, for the torus and other solids with holes and the. . . .
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 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.
This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.
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.
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!
Follow the hints and prove Pick's Theorem.
This is the second article on right-angled triangles whose edge lengths are whole numbers.
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.
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 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.
Prove that the shaded area of the semicircle is equal to the area of the inner circle.
Tom writes about expressing numbers as the sums of three squares.
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.
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.
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
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. . . .
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.