One of the most important parts of mathematics and logic is proof. A proof is the process by which we show that a statement is necessarily true. There are several methods for this.
In a direct proof, we proceed from known true statements through a sequence of logical steps to the statement to be proved.
The statement "if p, then q" can also be proved by proving its equivalent form "if not q, then not p".
Example: "If a number is divisible by 4, then it is divisible by 2." Contrapositive: "If a number is not divisible by 2, then it is not divisible by 4."
In an indirect proof, we assume that the statement is false and then derive a contradiction from it. Therefore, the statement must be true.
Example: Prove that √2 is irrational. Assume the opposite: that √2 is rational. Then it can be written as a/b, where a and b are integers with no common divisor. Deriving a contradiction, √2 cannot be rational.
We have reviewed and checked the materials, but errors may still occur. The content is provided for educational purposes only, so use it at your own responsibility and verify with other sources if needed.
Please sign in to ask Lara about Proof Methods.
Select Language
Set theme
© 2025 ReadyTools. All rights reserved.