CSI 2101 Study Guide - Quiz Guide: Mathematical Induction, The Algorithm, Bit Array

23 views4 pages

Document Summary

Due: thursday, march 22, at 1:00pm (in lecture) Induction and program correctness: (20 points) mathematical induction. Use induction to prove that for every positive integer n, n. X k=1 k2k = (n 1)2n+1 + 2. Let p (n) be the statement pn for all positive integers n. k=1 k2k = (n 1)2n+1 + 2. we show that p (n) is true. Basis step: we show that p (1) is true. X k=1 k2k = 1 21 = 2. (1 1)21+1 + 2 = 2. Inductive hypothesis: assume that for a positive integer m, we have that p (m) is true, which gives: m k2k = (m 1)2m+1 + 2. X k=1 k2k = (m + 1)2m+1 + m. = (m + 1)2m+1 + (m 1)2m+1 + 2. = ((m + 1) 1)2(m+1)+1 + 2 by inductive hypothesis. Thus, when p (m) is true, we have that p (m + 1) is true.

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