This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: guage is not C. CprE 310 Homework 3 14 Feb 2008, In class Problem 3.3 Prove the following for every integer n > 0. 1 2 + 2 2 + . . . + n 2 = n ( n + 1)(2 n + 1) 6 Problem 3.4 Prove the following for any integer n > 1. 1 1 2 + 1 2 3 + + 1 ( n1) n = n1 n Problem 3.5 For any real number x > 0 and integer n 2, prove the following. (1 + x ) n > 1 + nx Problem 3.6 For any nite set S , let  S  denote the number of elements in S . For any positive integer n , for any collection of n nite sets S 1 , S 2 , . . . , S n , prove the following.  S 1 S 2 S n   S 1  +  S 2  + . . . +  S n  2...
View
Full
Document
This note was uploaded on 03/26/2008 for the course CPR E 310 taught by Professor Srikanta during the Spring '08 term at Iowa State.
 Spring '08
 Srikanta

Click to edit the document details