proof:-
We will prove this by using contradiction.
Now ,
squaring on both sides,
(we know that ,by Euclid's lemma, for any prime p if
we can write a=np where n is any constant
i.e. a is multiple of p
put this in equation (1) ,
We get prime p such that p divides a as well as b. hence p is common factor of a and b
Which contradicts that a and b are coprime.
But what if the number is composite. ???
proof :-
Then we can write
as
---------- (1) where a and b are integer with
.and a and b are coprime.(gcd (a,b)=1).
( we will use Fundamental Theorem of Arithmetic, which states that Any positive integer >1 is itself a prime number or can be written as product of prime numbers.)
Which is not possible As we prove above,
Similarly we can prove the result for other composite irrational numbers.
No comments:
Post a Comment