Interactive · 3 questions
Proof by Infinite Descent
In this post we are going to go through a type of proof called Infinite Descent. Infinite Descent is a very effective method of solving Diophantine Equations.
Find all integer solutions to:
Obviously, is a trivial solution, but can we find any non-trivial solutions?
The terms and are both even, what can we deduce from this?
Since must be even, let us define where .
So we have:
Now, the terms and are both even, what can we deduce from this?
Since must be even, we define where .
You can probably see where this is going. The equation above is just the original equation but and replaced and .
Now, if we keep going, each can be replaced by a .
Similarly, each can be replaced by a .
If there is a solution that satisfies the original equation, the ordered pair is also a solution.
Now, since we are looking for integer solutions, Each and has a unique prime factorisation. All integers will have an integer number of factors of two.
Hence, at some point, and/or will not have a factor of . This is a contradiction, since then the left hand side will be odd. Hence, there are no other solutions to other than .
The above example is an example of Infinite Descent.
Do you think you can come up with an explanation of what Infinite descent is?
Infinite Descent relies on the fact that there are a finite number of positive integers that are less than an integer. We first prove for something to be true for an integer, it must be also be true for a second smaller integer. This implying that a third smaller integer is also a solution. And a forth, a fifth, etc. Then by Mathematical Induction, there cannot exist any solutions, or else it would require a contradiction.