13_Counting - Pigeonhole Principle (PhP) [KR, Section 6.2]...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Pigeonhole Principle (PhP) [KR, Section 6.2] 10/6/11 Theorem 1. If k is a positive integer and k+1or more objects are to be placed in k boxes, then at least one box contains at least two objects. Problem 3a, Section 6.2 A drawer has a dozen brown socks and a dozen black socks, randomly placed. If you draw socks at random w/o looking at the drawer, how many socks do you need draw to have a pair of socks of the same color? Problem 5 In any group of five integers (not necessarily consecutive), at least two of them have the same remainder when divided by 4. Example 3 The possible scores in a test are 0, 1, ..., 100. What is the minimum number of students that must take the test to guarantee that at least two students have the same score? Problem 3b . How many socks must be taken out to ensure at least two white socks? Worst case scenario: take out all brown socks first before taking out any white sock....
View Full Document

This note was uploaded on 03/21/2012 for the course CS 3333 taught by Professor Boppana during the Fall '11 term at The University of Texas at San Antonio- San Antonio.

Page1 / 6

13_Counting - Pigeonhole Principle (PhP) [KR, Section 6.2]...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online