Revisiting Irrational Numbers
Recall, a number ‘s’ is called irrational if it cannot be written in the form ,
To prove that a number like
Let p be a prime number. If p divides
We know from before that every number can be represented by its prime factors.
Let a=p1p2p3...pn, where p1,p2 etc are primes.
Then we have
We are given the fact that p divides
But we assumed a=p1p2p3....pn. And we just proved that p is one of p1,p2,p3,....pn.
From this we can clearly see p divides a.
Let us now try to prove
Let us say
That means we have a p and q such that
Suppose p and q have a common factor other than 1. Then, we divide by the common factor to get ,
Basically we try to remove the common factors between p and q so that there are no common factors excpet 1 which makes a and b as coprimes.
Squaring on both sides of the equation we get 2=
That is
If 2 divides a then we can write a=2c for some integer c.
Substituting for a we get
That is
This leads to
That means
So a is divided by 2 and b is divided by 2. But this is not possible as a and b are coprimes. We have reached an impossible state in our world. We reached this state because we made a wrong assumption. The assumption that
And that is,
This approach of proving things is known as proof by contradiction.