precept1 - Discuss the number rearrangement puzzle from...

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

View Full Document Right Arrow Icon
Computer Science 340 Reasoning about Computation Precept 1 Problem 1 Discuss the unstacking game from the Lehman Leighton notes, Section 3.3. Problem 2 Show that if you pick a subset S of size 501 from the set { 1 , 2 , . . . , 1000 } then there must exist two numbers a, b S such that a divides b . Problem 3
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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

This homework help was uploaded on 01/29/2008 for the course COS 340 taught by Professor Charikarandchazelle during the Fall '07 term at Princeton.

Ask a homework question - tutors are online