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

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.

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

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

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

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

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

Problem solving is at the heart of the NRICH site. All the problems give learners opportunities to learn, develop or use mathematical concepts and skills. Read here for more information.

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

A polite number can be written as the sum of two or more consecutive positive integers. Find the consecutive sums giving the polite numbers 544 and 424. What characterizes impolite numbers?

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?

Prove that if the integer n is divisible by 4 then it can be written as the difference of two squares.

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

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

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.

To find the integral of a polynomial, evaluate it at some special points and add multiples of these values.

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

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.

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

Learn about the link between logical arguments and electronic circuits. Investigate the logical connectives by making and testing your own circuits and fill in the blanks in truth tables to record. . . .

When number pyramids have a sequence on the bottom layer, some interesting patterns emerge...

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

By considering powers of (1+x), show that the sum of the squares of the binomial coefficients from 0 to n is 2nCn

A quadrilateral inscribed in a unit circle has sides of lengths s1, s2, s3 and s4 where s1 ≤ s2 ≤ s3 ≤ s4. Find a quadrilateral of this type for which s1= sqrt2 and show s1 cannot. . . .

Take any pair of two digit numbers x=ab and y=cd where, without loss of generality, ab > cd . Form two 4 digit numbers r=abcd and s=cdab and calculate: {r^2 - s^2} /{x^2 - y^2}.

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

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

Explain why, when moving heavy objects on rollers, the object moves twice as fast as the rollers. Try a similar experiment yourself.

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 orf two or more cubes.

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

Which is the biggest and which the smallest of $2000^{2002}, 2001^{2001} \text{and } 2002^{2000}$?

Four jewellers possessing respectively eight rubies, ten saphires, a hundred pearls and five diamonds, presented, each from his own stock, one apiece to the rest in token of regard; and they. . . .

An inequality involving integrals of squares of functions.

You have twelve weights, one of which is different from the rest. Using just 3 weighings, can you identify which weight is the odd one out, and whether it is heavier or lighter than the rest?

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

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

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

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

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.

Explore a number pattern which has the same symmetries in different bases.

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.

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.