Question

What is wrong with the following proof that every positive integer equals the nex larger positive integer? Proof, Let P(n) be the proposition that n = n + 1, Assume that P(k) is true, so that k = k + 1 . Add 1 to both sides of this equation to obtain k + 1-k + 2 . Since this is the statement P(k 1), It follows that P(n) is true for all positive integers n.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

inego ob kun be caus the Basis in ducion s bal

Add a comment
Know the answer?
Add Answer to:
What is wrong with the following proof that every positive integer equals the nex larger positive...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 50. What is wrong with this "proof? "Theorem For every positive integer n = (n +...

    50. What is wrong with this "proof? "Theorem For every positive integer n = (n + /2. Basis Step: The formula is true for n = 1. Inductive Step: Suppose that +Y/2. Then -(+972 +*+- +*+1)/2 + + + /- + 1). By the inductive hypothesis, we have + /2-[(++P/2, completing the + inductive step.

  • 3 For each positive integer n, define E(n) 2+4++2n (a) Give a recursive definition for E(n)....

    3 For each positive integer n, define E(n) 2+4++2n (a) Give a recursive definition for E(n). (b) Let P(n) be the statement E(n) nn1)." Complete the steps below to give a proof by induction that P(n) holds for every neZ+ i. Verify P(1) is true. (This is the base step.) ii. Let k be some positive integer. We assume P(k) is true. What exactly are we assuming is true? (This is the inductive hypothesis.) iii. What is the statement P(k...

  • 1. What is wrong with the following proof that shows all integers are equal? (Please explain...

    1. What is wrong with the following proof that shows all integers are equal? (Please explain which step in this proof is incorrect and why is it so.) Let P(n) be the proposition that all the numbers in any set of size n are equal. 1) Base case: P(1) is clearly true. 2) Now assume that P(n) is true. That is for any set of size n all the numbers are the same. Consider any set of n + 1...

  • please answer questions #7-13 7. Use a direct proof to show every odd integer is the...

    please answer questions #7-13 7. Use a direct proof to show every odd integer is the difference of two squares. [Hint: Find the difference of squares ofk+1 and k where k is a positive integer. Prove or disprove that the products of two irrational numbers is irrational. Use proof by contraposition to show that ifx ty 22 where x and y are real numbers then x 21ory 21 8. 9. 10. Prove that if n is an integer and 3n...

  • 3) What is wrong with the following proof that all horses have the same color? Let...

    3) What is wrong with the following proof that all horses have the same color? Let P(n) be the proposition that all the horses in a set of n horses are the same color. Clearly, P(1) is true. Now assume that P(n) is true. That is, assume that all the horses in any set of n horses are the same color Consider any n1 horses; number these as horses 1,2,3,...,n,n +1. Now the first n of these horses all must...

  • In the following problem, we will work through a proof of an important theorem of arithmetic. Your job will be to read the proof carefully and answer some questions about the argument. Theorem (The Di...

    In the following problem, we will work through a proof of an important theorem of arithmetic. Your job will be to read the proof carefully and answer some questions about the argument. Theorem (The Division Algorithm). For any integer n ≥ 0, and for any positive integer m, there exist integers d and r such that n = dm + r and 0 ≤ r < m. Proof: (By strong induction on the variable n.) Let m be an arbitrary...

  • Ok = (6) Let n be a positive integer. For every integer k, define the 2...

    Ok = (6) Let n be a positive integer. For every integer k, define the 2 x 2 matrix cos(27k/n) - sin(2nk/n) sin(2tk/n) cos(27 k/n) (a) Prove that go = I, that ok + oe for 0 < k < l< n - 1, and that Ok = Okun for all integers k. (b) Let o = 01. Prove that ok ok for all integers k. (c) Prove that {1,0,0%,...,ON-1} is a finite abelian group of order n.

  • Let S(n) be a statement parameterized by a positive integer n. Consider a proof that uses...

    Let S(n) be a statement parameterized by a positive integer n. Consider a proof that uses strong induction to prove that for all n 4.S(n) is true. The base case proves that S(4), S(5), S(6), S(7), and S(8) are all true. Select the correct expressions to complete the statement of what is assumed and proven in the inductive step. Supposed that for k> (1?),s() is true for everyj in the range 4 through k. Then we will show that (22)...

  • 8. (a) Prove that if p and q are prime numbers then p2 + pq is...

    8. (a) Prove that if p and q are prime numbers then p2 + pq is not a perfect square. (b) Prove that, for every integer a and every prime p, if p | a then ged(a,pb) = god(a,b). Is the converse of this statement true? Explain why or why not. (c) Prove that, for every non-zero integer n, the sum of all (positive or negative) divisors of n is equal to zero. 9. Let a and b be integers...

  • (a) Let n be any positive integer. Briefly explain (no formal proofs) why n > 1...

    (a) Let n be any positive integer. Briefly explain (no formal proofs) why n > 1 ≡ ¬(n = 1). (b) Recall that a positive integer p is prime iff there do not exist a positive integers n and m, both greater than 1, such that p = nm. (I.e., Prime(p) means ¬∃n ∃m (n > 1 ∧ m > 1 ∧ p = nm).) Give a formal proof of the following: for any prime p, any positive integers n...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT