Powers of numbers behave in surprising ways. Take a look at some of these and try to explain why they are true.

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

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

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

Imagine we have four bags containing numbers from a sequence. What numbers can we make now?

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

Factorial one hundred (written 100!) has 24 noughts when written in full and that 1000! has 249 noughts? Convince yourself that the above is true. Perhaps your methodology will help you find the. . . .

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

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.

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?

Show that if three prime numbers, all greater than 3, form an arithmetic progression then the common difference is divisible by 6. What if one of the terms is 3?

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.

Let a(n) be the number of ways of expressing the integer n as an ordered sum of 1's and 2's. Let b(n) be the number of ways of expressing n as an ordered sum of integers greater than 1. (i) Calculate. . . .

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.

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.

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

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

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.

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

Which set of numbers that add to 10 have the largest product?

Three frogs hopped onto the table. A red frog on the left a green in the middle and a blue frog on the right. Then frogs started jumping randomly over any adjacent frog. Is it possible for them to. . . .

A introduction to how patterns can be deceiving, and what is and is not a proof.

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

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.

Take any prime number greater than 3 , square it and subtract one. Working on the building blocks will help you to explain what is special about your results.

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.

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?

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

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

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?

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

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?

Explore what happens when you draw graphs of quadratic equations with coefficients based on a geometric sequence.

If I tell you two sides of a right-angled triangle, you can easily work out the third. But what if the angle between the two sides is not a right angle?

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.

Can the pdfs and cdfs of an exponential distribution intersect?

By proving these particular identities, prove the existence of general cases.

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.

Sort these mathematical propositions into a series of 8 correct statements.

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

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.

Patterns that repeat in a line are strangely interesting. How many types are there and how do you tell one type from another?

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

Given a set of points (x,y) with distinct x values, find a polynomial that goes through all of them, then prove some results about the existence and uniqueness of these polynomials.