Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

Proof by Infinite Descent

Number Theory

A proof by infinite descent, also called Fermat's method of descent, is a kind of proof by contradiction used to show that a statement cannot hold for any natural number: the method shows that if the statement held for some number, it would also have to hold for a smaller number, and repeating this indefinitely produces an infinite decreasing sequence of natural numbers, which is impossible, giving a contradiction. It is often used to show that a given equation, such as a Diophantine equation, has no solutions, typically by assuming a solution exists and deriving a second, smaller solution, or equivalently by assuming a smallest counterexample and deriving a still smaller one. The technique traces back to Euclid's Elements, in Proposition 31 of Book 7, but it takes its common name from Pierre de Fermat, who developed and popularized it, applying it extensively to Diophantine equations. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Connections

Proved By

Source Proof by Infinite Descent (Wikipedia)
Sources
Proof by Infinite Descent (Wikipedia)
Lead section
Quote, Lead section
In mathematics, a proof by infinite descent, also known as Fermat's method of descent, is a particular kind of proof by contradiction used to show that a statement cannot possibly hold for any number, by showing that if the statement were to hold for a number, then the same would be true for a smaller number, leading to an infinite descent and ultimately a contradiction.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.