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.
Find the largest integer which divides every member of the
following sequence: 1^5-1, 2^5-2, 3^5-3, ... n^5-n.
If x + y = -1 find the largest value of xy by coordinate geometry, by calculus and by algebra.
A composite number is one that is neither prime nor 1. Show that
10201 is composite in any base.
Explore what happens when you draw graphs of quadratic equations
with coefficients based on a geometric sequence.
Can you work through these direct proofs, using our interactive
If a two digit number has its digits reversed and the smaller of the two numbers is subtracted from the larger, prove the difference can never be prime.
Given any two polynomials in a single variable it is always
possible to eliminate the variable and obtain a formula showing the
relationship between the two polynomials. Try this one.
Four jewellers possessing respectively eight rubies, ten saphires,
a hundred pearls and five diamonds, presented, each from his own
stock, one apiece to the rest in token of regard; and they. . . .
When number pyramids have a sequence on the bottom layer, some interesting patterns emerge...
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
Can you discover whether this is a fair game?
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.
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.
Find all the solutions to the this equation.
Show that if you add 1 to the product of four consecutive numbers
the answer is ALWAYS a perfect square.
A, B & C own a half, a third and a sixth of a coin collection.
Each grab some coins, return some, then share equally what they had
put back, finishing with their own share. How rich are they?
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.
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.
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. . . .
Given that u>0 and v>0 find the smallest possible value of
1/u + 1/v given that u + v = 5 by different methods.
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.
An article which gives an account of some properties of magic squares.
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.
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.
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.
Peter Zimmerman, a Year 13 student at Mill Hill County High School
in Barnet, London wrote this account of modulus arithmetic.
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.
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 orf two or more cubes.
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.
Tom writes about expressing numbers as the sums of three squares.
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?
Follow the hints and prove Pick's Theorem.
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?
The first of two articles on Pythagorean Triples which asks how many right angled triangles can you find with the lengths of each side exactly a whole number measurement. Try it!
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
Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) =
It is impossible to trisect an angle using only ruler and compasses
but it can be done using a carpenter's square.
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
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.
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...
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. . . .
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.
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 looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.
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.
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.