×
×

# What is wrong with this "proof""Theorem" For every ISBN: 9780073383095 37

## Solution for problem 51E Chapter 5.1

Discrete Mathematics and Its Applications | 7th Edition

• Textbook Solutions
• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants Discrete Mathematics and Its Applications | 7th Edition

4 5 0 423 Reviews
27
5
Problem 51E

What is wrong with this "proof"?"Theorem" For every positive integer n, if x and y are positive integers with max(x, y) = n, then x = y.Basis Step: Suppose that n = 1. If max(x, y) = 1 and x and y are positive integers, we have x = 1 and y = 1.Inductive Step: Let k be a positive integer. Assume that whenever max (x, y) = k and x and y are positive integers, then x = y. Now let max(x, y) = k + 1, where x and y are positive integers. Then max(x ? 1, y ? 1) = k, so by the inductive hypothesis, x ? 1 = y ?1. It follows that x = y, completing the inductive step.

Step-by-Step Solution:
Step 1 of 3

Model Building and Gains from Trade Tuesday, January 24, 2017 4:16 PM Scientific Method in Economics -­‐Construct a theory (or hypothesis) -­‐Design experiments to test the theory -­‐collect data -­‐Revise or refute the theory based on the evidence Their lab is the...

Step 2 of 3

Step 3 of 3

##### ISBN: 9780073383095

The answer to “What is wrong with this "proof"?"Theorem" For every positive integer n, if x and y are positive integers with max(x, y) = n, then x = y.Basis Step: Suppose that n = 1. If max(x, y) = 1 and x and y are positive integers, we have x = 1 and y = 1.Inductive Step: Let k be a positive integer. Assume that whenever max (x, y) = k and x and y are positive integers, then x = y. Now let max(x, y) = k + 1, where x and y are positive integers. Then max(x ? 1, y ? 1) = k, so by the inductive hypothesis, x ? 1 = y ?1. It follows that x = y, completing the inductive step.” is broken down into a number of easy to follow steps, and 125 words. This full solution covers the following key subjects: Positive, max, integers, inductive, Integer. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. The full step-by-step solution to problem: 51E from chapter: 5.1 was answered by , our top Math solution expert on 06/21/17, 07:45AM. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. Since the solution to 51E from 5.1 chapter was answered, more than 266 students have viewed the full step-by-step answer. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095.

Unlock Textbook Solution