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.

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 sums of the squares of three related numbers is also a perfect square - can you explain why?

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.

The problem is how did Archimedes calculate the lengths of the sides of the polygons which needed him to be able to calculate square roots?

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

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?

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.

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.

Can you convince me of each of the following: If a square number is multiplied by a square number the product is ALWAYS a square number...

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.

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

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.

Keep constructing triangles in the incircle of the previous triangle. What happens?

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

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.

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

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

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?

Find the largest integer which divides every member of the following sequence: 1^5-1, 2^5-2, 3^5-3, ... n^5-n.

The nth term of a sequence is given by the formula n^3 + 11n . Find the first four terms of the sequence given by this formula and the first term of the sequence which is bigger than one million. . . .

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

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

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?

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

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

An iterative method for finding the value of the Golden Ratio with explanations of how this involves the ratios of Fibonacci numbers and continued fractions.

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

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

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?

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.

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?

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.

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.

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.

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

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

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.

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

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