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.

This article invites you to get familiar with a strategic game called "sprouts". The game is simple enough for younger children to understand, and has also provided experienced mathematicians with. . . .

A circle has centre O and angle POR = angle QOR. Construct tangents at P and Q meeting at T. Draw a circle with diameter OT. Do P and Q lie inside, or on, or outside this circle?

Mark a point P inside a closed curve. Is it always possible to find two points that lie on the curve, such that P is the mid point of the line joining these two points?

Can you work through these direct proofs, using our interactive proof sorters?

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

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

Can you see how this picture illustrates the formula for the sum of the first six cube numbers?

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.

Three equilateral triangles ABC, AYX and XZB are drawn with the point X a moveable point on AB. The points P, Q and R are the centres of the three triangles. What can you say about triangle PQR?

What happens to the perimeter of triangle ABC as the two smaller circles change size and roll around inside the bigger circle?

This is an interactivity in which you have to sort the steps in the completion of the square into the correct order to prove the formula for the solutions of quadratic equations.

This is an interactivity in which you have to sort into the correct order the steps in the proof of the formula for the sum of a geometric series.

Use this interactivity to sort out the steps of the proof of the formula for the sum of an arithmetic series. The 'thermometer' will tell you how you are doing

A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.

Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2

If a two digit number has its digits reversed and the smaller of the two numbers is subtracted from the larger, prove the difference can never be prime.

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

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

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

The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.

Show that if you add 1 to the product of four consecutive numbers the answer is ALWAYS a perfect square.

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?

Take any prime number greater than 3 , square it and subtract one. Working on the building blocks will help you to explain what is special about your results.

It is impossible to trisect an angle using only ruler and compasses but it can be done using a carpenter's square.

In this article we show that every whole number can be written as a continued fraction of the form k/(1+k/(1+k/...)).

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

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!

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.

This is the second article on right-angled triangles whose edge lengths are whole numbers.

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.

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?

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.

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 looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.

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.

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

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.

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 which gives an account of some properties of magic squares.

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

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.

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

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.