Find a connection between the shape of a special ellipse and an infinite string of nested square roots.

Make and prove a conjecture about the value of the product of the Fibonacci numbers $F_{n+1}F_{n-1}$.

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.

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

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.

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.

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

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.

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.

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.

Is the mean of the squares of two numbers greater than, or less than, the square of their means?

Janine noticed, while studying some cube numbers, that if you take three consecutive whole numbers and multiply them together and then add the middle number of the three, you get the middle number. . . .

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

Explore the continued fraction: 2+3/(2+3/(2+3/2+...)) What do you notice when successive terms are taken? What happens to the terms if the fraction goes on indefinitely?

What can you say about the lengths of the sides of a quadrilateral whose vertices are on a unit circle?

When if ever do you get the right answer if you add two fractions by adding the numerators and adding the denominators?

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

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

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.

Have a go at being mathematically negative, by negating these statements.

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

This problem is a sequence of linked mini-challenges leading up to the proof of a difficult final challenge, encouraging you to think mathematically. Starting with one of the mini-challenges, how. . . .

Draw some quadrilaterals on a 9-point circle and work out the angles. Is there a theorem?

Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.

Can you rearrange the cards to make a series of correct mathematical statements?

Pick a square within a multiplication square and add the numbers on each diagonal. What do you notice?

Take any two numbers between 0 and 1. Prove that the sum of the numbers is always less than one plus their product?

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.

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?

Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.

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

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.

Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) = 1.

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

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.

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

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

Prove that, given any three parallel lines, an equilateral triangle always exists with one vertex on each of the three lines.

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.

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