Proof by contradiction is one of the basic proof techniques in mathematics. A
proof by contradiction works as follows, suppose we are trying to prove some statement P (we go over an example soon where P is the statement √
2 is irrational).
Then, one way we can prove P is by assuming that P is false and deriving a contradiction. For our first example we recall the following