Wednesday
October 22, 2014

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...
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 - 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...
MATH - Find the only positive integer whose cube is the sum of the cubes of ...
math, algebra - 2a+2ab+2b I need a lot of help in this one. it says find two ...
DISCRETE MATHS - We need to show that 4 divides 1-n2 whenever n is an odd ...
MATH - Let’s agree to say that a positive integer is prime-like if it is not ...
math - Let’s agree to say that a positive integer is prime-like if it is not ...

Search
Members