Try to prove the irrationality of using the approach of proof by contradiction. Will the same approach work for , or ? [Page No. 55]
We have to prove is irrational.
Let us assume the opposite i.e., is rational.
Hence, can be written in the form where and () are co-prime (no common factor other than 1)
Hence,
Squaring both sides
Hence, 3 divides .
By theorem: If is a prime number, and divides , then divides , where is a positive number.
So, 3 shall divide also.
Hence, we can say
Now we know that
Putting
Hence, 3 divides .
By theorem: If is a prime number, and divides , then divides , where is a positive number.
So, 3 divides also ...(ii)
By (i) and (ii)
3 divides both &
Hence, 3 is factor of and .
So, & have a factor 3.
Therefore, & are not co-prime.
Hence, our assumption is wrong.
By contradiction, is irrational.
Now, we are asked
Will the same approach work for , or ?
Yes, we use the same approach for , or and indeed any square root of a number that isn't a perfect square.
If we swap the '3' for a '5', the logic holds perfectly.