Proof by Contradiction
Jump to navigation
Jump to search
- A Proof by Contradiction is a Proof of a Mathematical Statement that first assumes the opposite of the Mathematical Statement is True, and then presents a sequence of steps that lead to a Mathematical Contradiction.
- Example(s):
- Euclid's Proof by Contradiction which assumes that there is a largest Prime Number.
- See: Logic, Counterexample.