precept1 - Computer Science 340 Reasoning about Computation...

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

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
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

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

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern