Unformatted text preview: week, after you have had a chance to do them yourself. 1. ∑ =+ =n 1 i 3 1 ) 1 n 4 )( 1 n ( n ) 1 i 2 ( i 2 2. ∑ = + + = + n 1 i 3 4 ) 2 n )( 1 n ( n ) 2 i 2 ( i 2 3. ∑ = + = + n 1 i ) 1 n ( 4 n ) 2 i 2 ( i 2 1 4. ∑ = + + + = + + + n 1 i ) 2 n )( 1 n ( 4 ) 11 n 5 ( n ) 2 i )( 1 i ( i 3 i...
View
Full Document
 Summer '09
 Computer Science, Inductive Reasoning, Mathematical proof, induction proofs, straightforward induction problems

Click to edit the document details