Show that √p is irrational if p is prime.
I did the proof before that √2 is irrational by contradiction:
Let's assume that √2 is rational, therefore given m and n sharing no common factor:
√2=mn
2=m2n2
2n2=m2
As 2∣2n2 , it follows that 2∣m2, and that 2∣m.
Therefore ∃k∈Z s.t. m=2k
Using back
2n2=m2 and substituting m=2k in it, we have:
2n2=(2k)2
2n2=4k2
n2=2k2
Similarly, as 2∣2k2, it follows that 2∣n2, and that 2∣n.
Therefore, ∃j∈Z s.t. n=2j
Finally, if m=2k and n=2j n,j∈Z, m and n share a common factor 2. We have a contradiction with the assumption.
It follows that √2 cannot be rational but irrational.
This is where I am so far with my understanding. What would the best approach be with the original question?
What would be the approach be here? I was thinking to state that if p is composite then ∃x,y,m,n∈Z, all four prime numbers, s.t. p=xy.and have then
√xy=mn
but I don't see how I could move forward in this direction.
Much appreciated
Answer
Why not just try the same thing? Assume √p=mn for coprime m,n. Then p=m2/n2⟹m2=pn2. Hence p∣m2⟹p∣m by Euclid's Lemma. Then p∣n2⟹p∣n. Contradiction.
No comments:
Post a Comment