Let us assume that √2 is rational. So, we can find integers p and q(≠0) such that, √2=pq
Suppose p and q have a common factor other than 1.
Then, we divide by the common factor to get √2=ab, where a and b are co-prime.
So, b√2=a
Squaring on both sides, we get
2b2=a2
Therefore, 2 divides a2
Now, we know that, if a prime number, p divides a2, then p divides a, where a is a positive integer.
Hence, 2 divides a.
So, we can write a=2c for some integer c.
Substituting for a, we get 2b2=4c2
⇒b2=2c2
This means that 2 divides b2 and so, 2 divides b.
Therefore, a and b have at least 2 as a common factor.
But, this contradicts the fact that a and b have no common factors other than 1.
This contradiction is because of our incorrect assumption that √2 is rational.
So, we can conclude that √2 is irrational. [Hence proved]