Let √2 is a rational number.
So, we can find integers p and q(≠0) such that √2=pq.
Let 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 coprime numbers.
So, b√2=a.
Square both the sides, 2b2=a2.
Therefore, 2 divides a2. Now, by theorem, it follows that 2 divides a.
So, we can write a=2c for some integer c.
Therefore, 2b2=4c2
and 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 has arisen because of our incorrect assumption that √2 is a rational number.
So,
we can conclude that √2 is an irrational number.
Therefore, hence proved.