Let be a rational number and be an irrational number. Use proof by contradiction to show that is an irrational number.
Proof:
Let be a rational number and be an irrational number. We need to prove that is irrational using proof by contradiction.
Assume that is rational. This is the negation of what we need to prove.
Since is rational, we can write
where and are integers and .
Since is rational, we can write
where and are integers and .
Now,
Since and are integers and , is a rational number.
This is a contradiction, because we have shown to be rational, but by our hypothesis, is irrational.
The contradiction has arisen because of the faulty assumption that is rational. Therefore, is irrational.
Explanation
This question tests the student's understanding of proof by contradiction, similar to Example 15 in the textbook context which proves that the product of a non-zero rational and an irrational number is irrational. The key steps are: (1) assume the negation of what needs to be proved, (2) use the definition of rational numbers to express quantities as fractions, (3) derive that would be rational, (4) identify the contradiction with the given hypothesis, and (5) conclude the original statement is true. The proof structure mirrors the textbook's approach for the product case.
Solution Steps
Step 1: Let be rational and be irrational. Assume is rational (negation).
Step 2: Write and , where are integers with , .
Step 3: Express .
Step 4: Since and are integers with , would be rational.
Step 5: This contradicts the hypothesis that is irrational. Hence, is irrational.