Sign In Sign Up Ask an AI advisor
jtmoney10
jtmoney10
10.11.2019 • 
Mathematics

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. online discussion guidelines: post your logical argument on the discussion forum. read the logical argument of your peers. reply the results posted by at least two of your peers.

Solved
Show answers

Ask an AI advisor a question

I want advice