Beautiful mathematics. Two 18 year old students gave eight different proofs of one result then generalised it from the 3 by 1 case to the n by 1 case and proved the general result.
How can we solve equations like 13x + 29y = 42 or 2x +4y = 13 with the solutions x and y being integers? Read this article to find out.
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.
The familiar Pythagorean 3-4-5 triple gives one solution to (x-1)^n + x^n = (x+1)^n so what about other solutions for x an integer and n= 2, 3, 4 or 5?
