SOLUTION: Prove that no rational number is equal to √p, where p is a prime number, using proof by contradiction.

SOLUTION: Prove that no rational number is equal to √p, where p is a prime number, using proof by contradiction.

Algebra.Com

Question 1129207: Prove that no rational number is equal to √p, where p is a prime number, using proof by contradiction.
Answer by ikleyn(52778) (Show Source): You can put this solution on YOUR website!
.
See the lesson
- Proving irrationality of some real numbers
in this site.

RELATED QUESTIONS
Using proof by contradiction, prove that 7√2 is... (answered by MathLover1)

Use the factor theorem to show that if 2^p - 1, where p does not equal 3, is a prime... (answered by Edwin McCravy)

To show that is an irrational number unless n is a perfect square, explain how the... (answered by solver91311)

Prove that the product of two odd numbers is odd, using an indirect proof and a proof by... (answered by josgarithmetic,ikleyn)

Let n be a positive integer, k the number of prime numbers less than or equal to n, and... (answered by richard1234)

For a prime p>3, prove that p^2 - 1 is divisible by 12 (answered by Edwin McCravy)

I need help with this question please. If p is a prime number and ɸ is the Euler... (answered by richard1234)

Dealing with contradiction: Show that for any positive integer a and any prime p, if p... (answered by venugopalramana)

Use proof by contradiction to prove/disprove that no integers x and y exist such that... (answered by ikleyn)