21127 Study Guide - Quiz Guide: Natural Number

175 views2 pages

Document Summary

Let"s continue to work through some inductive arguments, emphasizing the problem-solving aspects of identifying a recursive relationship. Claim: 3n 2n+1 for every natural number n that is greater than or equal to 2. Thus, the inequality holds when n = 2. (also, notice that when n = 1, 3 (cid:54) 4. ) Next, suppose that k is some arbitrary and xed natural number that is greater than or equal to two, and that the inequality holds when n = k. This means that we know 3k 2k+1. We want to show (wwts) that 3k+1 2k+2. (here, we emphasize the scratch work vs. written proof aspect of proof-writing. Let"s do some work on the side to gure out the cleanest way of presenting the argument, then write it up. ) Next, we know that 3 2 and 2k+1 > 0, so we can deduce. Then, since greater than or equal to is transitive, we can write. 3k+1 3 2k+1 2k+2 and thus,

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents

Related Questions