CSCountingv.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Proof of G.P.P. By contradiction. Suppose every place has ?N/k? objects, thus ≤ ?N/k??1. Then the total number of objects is at most So, there are less than N objects, which contradicts our assumption of N objects! QED * G.P.P. Example Given: There are 280 people in the party. Without knowing anybody’s birthday, what is the largest value of n for which we can prove that at least n people must have been born in the same month? Answer: ?280/12? = ?23.3? = 24 A bowl contains 10 red and 10 yellow balls How many balls must be selected to ensure 3 balls of the same color? One solution: Direct proof. consider the “worst” case Consider 2 balls of each color You can’t take another ball without hitting 3 Thus, the answer is 5 Via generalized pigeonhole principle How many balls are required if there are 2 colors, and one color must have 3 balls of same color? How many pigeons are required if there are 2 pigeon holes, and one must have 3 pigeons in one hole? number of boxes: k = 2 We want ??N/k? = 3 What is the minimum N? N = 5 A bowl contains 10 red and 10 yellow balls How many balls must be selected to ensure 3 yellow balls? Consider the “worst” case Consider 10 red balls and 2 yellow balls You can’t take another ball without hitting 3 yellow balls Thus, the answer is 13 Contrast with previous example! Consider 5 distinct points (xi, yi) with integer values, where i = 1, 2, 3, 4, 5. Show that the midpoint of at least one pair of these five points also has integer coordinates. (So, 5 points somewhere on a grid. Draw all connecting line segments. One of the midpoints must be on the grid!) Thus, we are looking for the midpoint of a segment from (a,b) to (c,d) The midpoint is ( (a+c)/2, (b+d)/2 ) Note that the midpoint will be integers if a and c have the same parity: are either both even or both odd Same for b and d There