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.

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

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?

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

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

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?

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.

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

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.

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.

Some diagrammatic 'proofs' of algebraic identities and inequalities.

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.

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

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.

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.

Prove Pythagoras' Theorem using enlargements and scale factors.

Fractional calculus is a generalisation of ordinary calculus where you can differentiate n times when n is not a whole number.

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.

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.

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.

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

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.

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

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.

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

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

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

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.

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 five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.

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.

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.

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

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

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.

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.

An article which gives an account of some properties of magic squares.