| Instructor: Gábor Hetyei | Last update: Friday, December 12, 2008 |
| Disclaimer: The information below comes with no warranty. If, due to typographical error, there is a discrepancy between the exercises announced in class and the ones below, or this page is not completely up to date, the required homework consists of those exercises which were announced in class. Check for the time of last update above. If, by my mistake, a wrong exercise shows up below, I will allow you extra time to hand in the exercise that was announced in class. If, however, exercises are missing because this page is not up to date, it is your responsibility to contact me before the due date. (No extra time will be allowed in that case.) This page is up to date if the last update happened after the last class before the next due date. |
Notation: 23.1/(4)a means exercise 1, part (4)a, in section 23.
| No. | Date due: | Problems: |
| 14 | Tue Dec 9 |
24.1, 24.2, 25.1b, 26.1cd. Our final exam will be on Thursday December 18 at 3:00 pm. You may download the Study Guide I distributed in class. |
| 13 | Tue Dec 2 | 23.1/beg, 23.2. |
| 12 | Tue Dec 2 | 22.1/bc, 22.2/bcjm. |
| 11 | Th Nov 20 |
20.2, 20.3, 20.4, 20.6, 21.3 bd, 21.4c. Bonus: 21.6 |
| 10 | Tue Nov 11 | 19.1 bc, 19.2, 19.4c, 19.5. |
| 9 | Tue Nov 4 |
15.7, 15.9, 15.11, 15.12. Bonus: As n goes to infinity, what number does the probability of a random permutation being a derangement converge to? Our second test will be on Tuesday November 4. You may download the Study Guide I distributed in class. |
| 8 | Tue Oct 28 | 13.1 cd, 13.2 b, 14.1 bc, 15.1 (answer the part about {1,2,3,4} only), 15.2 e. |
| 7 | Tue Oct 21 | 18.1, 18.3, 18.4. |
| 6 | Th Oct 16 |
16.3, 16.4ac, 16.7, 16.10, 16.15, 17.3, 17.10 abc Bonus 17.10 d. |
| 5 | Tue Sep 30 |
11.1 adf, 11.3, 11.5, 11.7, 11.9, 11.16 acf.
Note: there was a typo here that I corrected on Monday, September 29, 2008. If you did 11.6 instead of 11.6 acf, I will allow extra time to do 11.16 acf. I apologize for the inconvenience. Bonus:
|
| 4 | Tue Sep 23 |
9.3, 9.5, 9.6, 10.1 cdf, 10.2 cdf, 10.4 bcde, 10.5 bce.
Bonus: Let n be a positive integer and p be a prime number. Use the base p representation of n to express the highest exponent m for which pm divides n. (Hint: involve the sum of the digits and the summation formula for a geometric sequence.) |
| 3 | Tue Sep 16 |
7.3, 7.6, 7.9bd, 7.12, 8.3, 8.4, 8.8 Bonus: 8.11 |
| 2 | Tue Sep 9 | 5.3, 5.7, 5.8, 6.11bf, 6.12b, 6.15ab. |
| 1 | Tue Sep 2 |
2.7, 2.9a, 3.1bd, 3.2, 3.4, 3.8; 4.2, 4.13, 4.15. Bonus: 2.9b (write a pseudocode); find the answer to 2.9a in St. Augustine's book "The City of God". |