**Unformatted text preview: **Discuss the number rearrangement puzzle from Lehman Leighton, Section 3.2. Problem 4 (Stirling’s Approximation) Prove the following inequality: e ± n e ² n ≤ n ! ≤ en ± n e ² n Problem 5 Prove that n X i =1 log i i = Θ((log n ) 2 )...

View
Full Document

- Fall '07
- CharikarandChazelle
- Lehman Leighton, Lehman Leighton notes