Use contradiction and prime divisibility theorems to formally prove that square roots of primes are irrational.
Introduce Theorem 1.2 and the proof approach.
In math, sometimes the easiest way to prove something is true is to assume it's false and watch the logic break down. This is called a proof by contradiction.
Formal statement of the prime divisibility theorem.
Theorem 1.3.
Prove that is irrational.
Let us assume, to the contrary, that is rational. That is, we can find coprime integers and () such that:
Example 5.
Prove that is irrational.
Let us assume, to the contrary, that is rational. That is, we can find integers and () such that:
Order the logical steps for proving sqrt(5) is irrational.
Arrange the steps to construct the proof by contradiction that $\sqrt{5}$ is irrational.
Exercise 1.2 Q1.
To prove that is irrational, let us assume the opposite: suppose it is rational.
This means we can find integers and , where , such that .
Squaring both sides gives .
This implies that divides , and therefore divides .
So, we can write for some integer .
Substituting this back into , we get .
This simplifies to .
So, also divides .
Since both and are divisible by , this contradicts our initial assumption that and have no common factor other than .
Hence, is irrational.