COMS W3134 Chapter 1: Data Structures textbook Notes 1
Document Summary
111 base case : prove true for some small value. 1 (a) assume theorem to be true for all cases up to k (b) show theorem is true for kt l l use theorem definition ) 12 = 1 ( it 1112111 t t ) Inductive hypothesis : assume theorem is true for all values k. = n ( ntl ) ( 2n -11 ) = ( ntl ) ( nilnatl ) + in -11 )) = in -11112n "t n t 6n -16 ) = ( ntl ) ( 2n " tf n -16 ) = ( ntl ) ( in -121162n -13 ) ) I (cid:12200) ( ( ntl 1) ( ( ntl itt 712 ( ntl it 1 i. " fie e k " is false " " compute for one value , show result proves theorem is false.