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

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.

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

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

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

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

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

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.

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.

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

Four jewellers share their stock. Can you work out the relative values of their gems?

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

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

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

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

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

Investigate circuits and record your findings in this simple introduction to truth tables and logic.

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

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

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

Euler found four whole numbers such that the sum of any two of the numbers is a perfect square...

Can you explain why a sequence of operations always gives you perfect squares?

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?

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

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.

Given that a, b and c are natural numbers show that if sqrt a+sqrt b is rational then it is a natural number. Extend this to 3 variables.

Can you work out where the blue-and-red brick roads end?

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.

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.

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

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.

Prove Pythagoras' Theorem using enlargements and scale factors.

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

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

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.

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.

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.

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.

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.

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

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.

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.

There are 12 identical looking coins, one of which is a fake. The counterfeit coin is of a different weight to the rest. What is the minimum number of weighings needed to locate the fake coin?

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

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