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.
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?
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.
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.
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?
Take any two numbers between 0 and 1. Prove that the sum of the
numbers is always less than one plus their product?
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.
Here the diagram says it all. Can you find the diagram?
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. . . .
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 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.
This is the second of two articles and discusses problems relating
to the curvature of space, shortest distances on surfaces,
triangulations of surfaces and representation by graphs.
A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
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.
Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2
Peter Zimmerman, a Year 13 student at Mill Hill County High School
in Barnet, London wrote this account of modulus arithmetic.
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.
An article which gives an account of some properties of magic squares.
Tom writes about expressing numbers as the sums of three squares.
The picture illustrates the sum 1 + 2 + 3 + 4 = (4 x 5)/2. Prove the general formula for the sum of the first n natural numbers and the formula for the sum of the cubes of the first n natural. . . .
If you think that mathematical proof is really clearcut and
universal then you should read this article.
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
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 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 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
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
These proofs are wrong. Can you see why?
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.
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?
Which of these roads will satisfy a Munchkin builder?
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
Have a go at being mathematically negative, by negating these
Prove that you cannot form a Magic W with a total of 12 or less or
with a with a total of 18 or more.
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. . . .
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?
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
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 has. . . .
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?
Four identical right angled triangles are drawn on the sides of a
square. Two face out, two face in. Why do the four vertices marked
with dots lie on one line?
Follow the hints and prove Pick's Theorem.
There are 12 identical looking coins, one of which is a fake. The
counterfeit coin is of a different weight to the rest. What is the
minimum number of weighings needed to locate the fake coin?
The knight's move on a chess board is 2 steps in one direction and one step in the other direction. Prove that a knight cannot visit every square on the board once and only (a tour) on a 2 by n board. . . .
What can you say about the lengths of the sides of a quadrilateral whose vertices are on a unit circle?
Can you invert the logic to prove these statements?
Show that if you add 1 to the product of four consecutive numbers
the answer is ALWAYS a perfect square.
To find the integral of a polynomial, evaluate it at some special
points and add multiples of these values.
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. . . .
It is impossible to trisect an angle using only ruler and compasses
but it can be done using a carpenter's square.