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...

Show that x = 1 is a solution of the equation x^(3/2) - 8x^(-3/2) = 7 and find all other solutions.

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.

Explore what happens when you draw graphs of quadratic equations with coefficients based on a geometric sequence.

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?

If x + y = -1 find the largest value of xy by coordinate geometry, by calculus and by algebra.

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?

Keep constructing triangles in the incircle of the previous triangle. What happens?

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.

An inequality involving integrals of squares of functions.

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/...)).

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?

Given a set of points (x,y) with distinct x values, find a polynomial that goes through all of them, then prove some results about the existence and uniqueness of these polynomials.

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.

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 number...

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.

Kyle and his teacher disagree about his test score - who is right?

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.

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.

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.

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?

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.

Prove Pythagoras' Theorem using enlargements and scale factors.

Prove that the shaded area of the semicircle is equal to the area of the inner circle.

Semicircles are drawn on the sides of a rectangle. Prove that the sum of the areas of the four crescents is equal to the area of the rectangle.

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.

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.

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. . . .

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.

A composite number is one that is neither prime nor 1. Show that 10201 is composite in any base.

This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.

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.

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.

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.

Peter Zimmerman, a Year 13 student at Mill Hill County High School in Barnet, London wrote this account of modulus arithmetic.

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.

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.

Patterns that repeat in a line are strangely interesting. How many types are there and how do you tell one type from another?

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.

Toni Beardon has chosen this article introducing a rich area for practical exploration and discovery in 3D geometry

Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.

Fractional calculus is a generalisation of ordinary calculus where you can differentiate n times when n is not a whole 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.