This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 1050 B: Constructing Proofs April 12, 2008 Solutions to Homework 7 Lecturer: Sasha Boldyreva Problem 7.1, 12 points. Problem 18 from Section 6.2 of Rosens textbook. a) 1/7. b) Following the Birthday bound reasoning: Pr(at least 2 are born on the same day) = 1- Pr(all born on different days) = 1- 6 7 5 7 ... 8- n 7 . c) Plug in n= 2, 3 and so on, and see that the first time it exceeds 1/2 is when n=4, so this is the answer. You can use the Birthday bound too. Problem 7.2, 5 points. Problem 20 from Section 6.2 of Rosens textbook. The probability that none of n people has a birthday today is (366 / 366) n . We need to find the smallest n such that this is less than 1/2. We can find that the answer is 254 by trial-and-error or by using logarithms. Problem 7.3, 5 points. Problem 24 (d) and (e) from Section 3.6 of Rosens textbook. Show the intermediate results. d) gcd(1529,14039)=gcd(1529,278)=gcd(278,139)=gcd(139,0)=139....
View Full Document
This note was uploaded on 08/27/2008 for the course CS 1050 taught by Professor Huang during the Spring '05 term at Georgia Institute of Technology.
- Spring '05