How can I prove that all prime numbers have irrational square roots?
My work so far: suppose that a prime p = a*a then p is divisible by a. Contradiction. Did I begin correctly? How to continue?
Answer
The standard proof for p=2 works for any prime number.
No comments:
Post a Comment