This preview shows page 1. Sign up to view the full content.
Unformatted text preview: k | m . Prove that a b (mod k ). 7. Suppose gcd( a, 21) = 1. Use Fermats Theorem to prove that a 6 1 (mod 21). 8. A drawer contains 7 red socks, 10 white socks and 8 blue socks. You grab three of the socks at random. What is the probability that all three are the same color? 9. Let S be a square of side length 1. Let P 1 , . . . , P 101 be 101 points inside of S . Prove that two of the points are a distance 2 / 10 apart. Hint: partition S into little squares of side 1 10 , and use the pigeonhole principle....
View Full Document
- Spring '09