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

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

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

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

The sums of the squares of three related numbers is also a perfect square - can you explain why?

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

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

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

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

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.

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

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

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

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

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

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.

Caroline and James pick sets of five numbers. Charlie chooses three of them that add together to make a multiple of three. Can they stop him?

We only need 7 numbers for modulus (or clock) arithmetic mod 7 including working with fractions. Explore how to divide numbers and write fractions in modulus arithemtic.

Prove that if a^2+b^2 is a multiple of 3 then both a and b are multiples of 3.

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

Prove that if a is a natural number and the square root of a is rational, then it is a square number (an integer n^2 for some integer n.)

Find the smallest positive integer N such that N/2 is a perfect cube, N/3 is a perfect fifth power and N/5 is a perfect seventh power.

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

Find all positive integers a and b for which the two equations: x^2-ax+b = 0 and x^2-bx+a = 0 both have positive integer solutions.

The sum of any two of the numbers 2, 34 and 47 is a perfect square. Choose three square numbers and find sets of three integers with this property. Generalise to four integers.

What can you say about the common difference of an AP where every term is prime?

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

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

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?

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

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

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

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

Prove Pythagoras' Theorem using enlargements and scale factors.

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.

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

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?

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.

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.