This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Additional exercises 1. Find a simple expression for n i =2 2 3 i . 2. Show by splitting the sum that X n =1 1 n 1 . 001 < . (You could use an integral approximation, but Id rather you split the sum instead.) 3. Show by splitting the sum that X n =2 1 n lg n = . (You could use an integral approximation, but Id rather you split the sum instead.) 1...
View
Full
Document
This note was uploaded on 12/13/2011 for the course CSCE 750 taught by Professor Fenner during the Fall '11 term at South Carolina.
 Fall '11
 Fenner
 Algorithms

Click to edit the document details