Monday, 27 June 2016

Explain the proof that the root of a prime number is an irrational number

Though the proof of this is done in a previous question, I have some doubt about a certain concept. So I ask to clarify it.



In the proof we say that p=ab (In their lowest form).
Now
p=a2/b2pb2=a2.



Hence p divides a2 so p divides a. We say that the above mentioned condition ("Hence p divides a2 so p divides a") is valid as p is a prime number. I didn't get the fact that why this is only true for prime numbers. Could someone please me this?

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...