Monday, December 31, 2018

all prime numbers have irrational square roots




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

analysis - Injection, making bijection

I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...