quiz3sol - n=k+1: + =-1 2 ) 1 1 ( k i i = 1 1 + k + =-1 2 )...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
COT 3100 Quiz #3 Solutions Date: 11/21/00 1) Using induction, show that the following formula is true for all integers n 2. = - n i i 2 ) 1 1 ( = n 1 Use induction on n. Base case: n=2. LHS = 1 – ½ = ½, RHS = ½. Thus we have LHS = RHS. Inductive hypothesis: Assume for an arbitrary value of n=k that = - k i i 2 ) 1 1 ( = k 1 Inductive Step: Under this assumption we must show that the formula holds for
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n=k+1: + =-1 2 ) 1 1 ( k i i = 1 1 + k + =-1 2 ) 1 1 ( k i i = [ =-k i i 2 ) 1 1 ( ] ( 1 1/(k+1)) = (1/k)*((k+1) 1)/(k+1) = (1/k)*(k/(k+1)) = 1/(k+1), completing the inductive step. Thus, we can conclude that =-n i i 2 ) 1 1 ( = n 1 for all positive integers n 2....
View Full Document

Ask a homework question - tutors are online