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.

Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) = 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.

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.

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

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.

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.

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.

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

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

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?

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

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 two numbers between 0 and 1. Prove that the sum of the numbers is always less than one plus their product?

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

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.

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 you see how this picture illustrates the formula for the sum of the first six cube numbers?

An article which gives an account of some properties of magic squares.

This article discusses how every Pythagorean triple (a, b, c) can be illustrated by a square and an L shape within another square. You are invited to find some triples for yourself.

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

If you think that mathematical proof is really clearcut and universal then you should read this article.

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

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.

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?

Janine noticed, while studying some cube numbers, that if you take three consecutive whole numbers and multiply them together and then add the middle number of the three, you get the middle number. . . .

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.

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

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

L triominoes can fit together to make larger versions of themselves. Is every size possible to make in this way?

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.

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.

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.

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

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

Try to solve this very difficult problem and then study our two suggested solutions. How would you use your knowledge to try to solve variants on the original problem?

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

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?

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

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?

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

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

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

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?