Thursday
December 5, 2013

# Posts by Francesca

Total # Posts: 155

Discrete Math
Here is the solution: The mistake is in applying the inductive hypothesis to look at max(x −1, y −1) . Notice that we are doing induction on n not on x or y. Even though x and y are positive integers, x −1 and y −1 need not be (one or both could be 0). ...

Discrete Math
Oh okay. . .I get it. . .Thank you so much for your help :)

Discrete Math
Thank you! So, going back to your counterexample in post 9:52: x=4, y=6, n=max(x,y)=6 Why does it =6? Sorry if this seems like a silly question. . .

Discrete Math
No, the question verbatim is "What is wrong with this proof?"

Discrete Math
Thank you for responding. Yes everything is typed correctly. I want to find what is wrong with proof.

Discrete Math
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, ...

Discrete Math
Use mathematical induction to prove the truth of each of the following assertions for all n ≥1. 5^2n – 2^5n is divisible by 7 If n = 1, then 5^2(1) - 2^5(1) = -7, which is divisible by 7. For the inductive case, assume k ≥ 1, and the result is true for n = k; ...

Discrete Math
Any suggestions?

Discrete Math
Any suggestions?

Discrete Math
Yea that's what I thought. . .Hey if you don't mind helping me further I have been working on this problem for a while and I am a bit stuck. IDK where to go from here or if I am doing it correctly: Use mathematical induction to prove the truth of each of the following ...

Pages: <<Prev | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | Next>>

Search
Members