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.
I am exactly n times my daughter's age. In m years I shall be ... How old am I?
Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2
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 geometric series.
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.
Can you make sense of these three proofs of Pythagoras' Theorem?
Show that if you add 1 to the product of four consecutive numbers the answer is ALWAYS a perfect square.
Can you work through these direct proofs, using our interactive proof sorters?
Can you discover whether this is a fair game?
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.
Can you explain why a sequence of operations always gives you perfect squares?
Use this interactivity to sort out the steps of the proof of the formula for the sum of an arithmetic series. The 'thermometer' will tell you how you are doing
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 first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
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?
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. . . .
Prove Pythagoras' Theorem using enlargements and scale factors.
Can you make sense of the three methods to work out the area of the kite in the square?
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?
Euler found four whole numbers such that the sum of any two of the numbers is a perfect square...
Some diagrammatic 'proofs' of algebraic identities and inequalities.
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.
A composite number is one that is neither prime nor 1. Show that 10201 is composite in any base.
Fractional calculus is a generalisation of ordinary calculus where you can differentiate n times when n is not a whole number.
ABCD is a square. P is the midpoint of AB and is joined to C. A line from D perpendicular to PC meets the line at the point Q. Prove AQ = AD.
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.
In this article we show that every whole number can be written as a continued fraction of the form k/(1+k/(1+k/...)).
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...
If you take two tests and get a marks out of a maximum b in the first and c marks out of d in the second, does the mediant (a+c)/(b+d)lie between the results for the two tests separately.
This follows up the 'magic Squares for Special Occasions' article which tells you you to create a 4by4 magicsquare with a special date on the top line using no negative numbers and no repeats.
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.
Here is a proof of Euler's formula in the plane and on a sphere together with projects to explore cases of the formula for a polygon with holes, for the torus and other solids with holes and the. . . .
Peter Zimmerman, a Year 13 student at Mill Hill County High School in Barnet, London wrote this account of modulus arithmetic.
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.
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.
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.
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.
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!
Follow the hints and prove Pick's Theorem.
This is the second article on right-angled triangles whose edge lengths are whole numbers.
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
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...
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.
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.
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.
Take any rectangle ABCD such that AB > BC. The point P is on AB and Q is on CD. Show that there is exactly one position of P and Q such that APCQ is a rhombus.
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.