Sunday
March 29, 2015

Homework Help: Discrete Math

Posted by Francesca on Friday, March 25, 2011 at 9:22pm.

Theorem: For every integer n, if x and y are positive integers with max(x, y) = n, then x = y.
Basic 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.

What's wrong with this proof?

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

Discrete Math - Let n be positive integer greater than 1. We call n prime if the...
C programming - Question: Write a program that reads integers from the keyboard ...
math - every week Brady gets $2.50 more for his allowance than Max does. They ...
Proofs and numbers - Prove the following theorem: Suppose p is a prime number, r...
discrete math - 1)prove that if x is rational and x not equal to 0, then 1/x is ...
MAth - If 1 gallon (gal) of water weighs 8.34 pounds (lb), how much does 3.75 ...
Math - Paulo withdraws the same amount from his bank account each week to pay ...
discrete math - Could someone help me with this induction proof. I know its true...
behavior problems (dogs) - please check my answer thanks You've evaluated Max, a...
Math - For homework we're supposed to give all the properties of different ...

Members