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.
A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
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.
Can you find the areas of the trapezia in this sequence?
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 frame.
Prove that, given any three parallel lines, an equilateral triangle always exists with one vertex on each of the three lines.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
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. . . .
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?
Take any two numbers between 0 and 1. Prove that the sum of the numbers is always less than one plus their product?
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.
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.
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.
Follow the hints and prove Pick's Theorem.
What can you say about the lengths of the sides of a quadrilateral whose vertices are on a unit circle?
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.
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.
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?
An article which gives an account of some properties of magic squares.
If you think that mathematical proof is really clearcut and universal then you should read this article.
Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2
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.
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?
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.
Clearly if a, b and c are the lengths of the sides of an equilateral triangle then a^2 + b^2 + c^2 = ab + bc + ca. Is the converse true?
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
These proofs are wrong. Can you see why?
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. . . .
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?
L triominoes can fit together to make larger versions of themselves. Is every size possible to make in this way?
Have a go at being mathematically negative, by negating these statements.
Can you explain why a sequence of operations always gives you perfect squares?
Pick a square within a multiplication square and add the numbers on each diagonal. What do you notice?
Can you invert the logic to prove these statements?
Which of these roads will satisfy a Munchkin builder?
Sort these mathematical propositions into a series of 8 correct 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?
Can you work through these direct proofs, using our interactive proof sorters?
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. . . .
Can you rearrange the cards to make a series of correct mathematical statements?
This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.
To find the integral of a polynomial, evaluate it at some special points and add multiples of these values.
Explore what happens when you draw graphs of quadratic equations with coefficients based on a geometric sequence.
Show that if you add 1 to the product of four consecutive numbers the answer is ALWAYS a perfect square.
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...
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
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.
The twelve edge totals of a standard six-sided die are distributed symmetrically. Will the same symmetry emerge with a dodecahedral die?