SOLUTION: Using proof by contradiction, prove that 7√2 is irrational.

Algebra.Com
Question 1130704: Using proof by contradiction, prove that 7√2 is irrational.
Answer by MathLover1(20849)   (Show Source): You can put this solution on YOUR website!

suppose that were rational:
Then we can write as a fractionwhere and are integers with no common factors.
Since , square both sides=>
So,
By the definition of even, this means is even. But then must be even if is even .
So for some integer .
If and , then
.
So . This means that is even, so must be even.
We now have a contradiction. and were chosen not to have any common factors.
But they are both even, i.e. they are both divisible by .
Because assuming that was rational led to a , it must be the case that is irrational.

RELATED QUESTIONS

Prove that no rational number is equal to √p, where p is a prime number, using... (answered by ikleyn)
Using proof by contradiction, show that (3+√2)/3 is... (answered by math_helper)
Prove that the product of two odd numbers is odd, using an indirect proof and a proof by... (answered by josgarithmetic,ikleyn)
Show that if x^2 is odd, x is odd. Use proof by... (answered by ikleyn)
Prove by contradiction log2 11 is irrational. I'm a little stuck. Thank... (answered by ikleyn)
suppose that q is a rational number that is not 0 or 1, and that x is irrational and... (answered by ikleyn)
Prove that the product of two consecutive nonzero even integers is never a perfect... (answered by Alan3354)
Prove by contradiction that the diagonals of a kite intersect at right angles? My proof... (answered by math_tutor2020)
Use proof by contradiction to prove/disprove that no integers x and y exist such that... (answered by ikleyn)