Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 4 - Elementary Number Theory and Methods of Proof - Exercise Set 4.6 - Page 206: 30

Answer

See below.

Work Step by Step

Answer may vary. To proof by contradiction, we only need assume one and should not use the word $every$. Thus we can change the original proof as "Suppose not. Suppose there exists an integer $n$ which is irrational. Then we have $n = n/1$, which is rational. This is a contradiction. [Hence the supposition is false and the theorem is true.] ”
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.