For better or for worse, Rosen's book is the 800lb gorilla in the discrete
mathematics textbook market. It is used at hundreds, and perhaps thousands,
of colleges and universities.
You might want to consult the
McGraw-Hill home
page for the book for student resources and other material.
Date | Themes | Sections | Homework problems |
Jan. 22 |
Intro to the course
|
Propositions and such
|
|
§§ 1.1-1.3 |
§1.1: 6, 10, 18, 22
|
§1.2: 6, 10, 16, 20, 32
|
§1.3: 10, 12, 18
|
|
|
Jan. 24 | Quantifiers, rules
of inference | §§ 1.4-1.6 |
§1.4: 10, 14, 28, 32
|
§1.5:
12, 14, 20, 24
|
§1.6:
8, 10, 14, 20
|
|
|
Jan. 29 | Proofs |
§§ 1.6-1.8 |
§1.7:
12, 16, 22, 30
|
§1.8:
8, 10, 14, 22
|
|
|
Jan. 31 |
Sets, functions and more |
§§ 2.1-2.3 |
§2.1:
10, 18, 22
|
§2.2:
14, 24, 30, 40, 52
|
§2.3:
4, 12, 20, 34
|
|
Feb. 5 |
Sequences, cardinality |
§§ 2.4-2.5 |
§2.4:
14, 20, 26, 28
|
§2.5:
4, 10, 22, 24, 30
|
|
Feb. 7 |
The beginning of number theory!
|
§§ 4.1-4.3
|
§4.1:
16, 30, 36, 40
|
§4.2:
6ac, 8, 22ac, 28
|
§4.3:
6, 18, 30, 36
|
|
Feb. 12 |
More number theory |
§ 4.3 |
|
Feb. 14 |
Consequences of Bézout's theorem
|
§ 4.4
|
§4.4:
14, 16, 18, 34
|
Feb. 19 |
Crpyto and some review
|
§ 4.6 |
§4.6:
2c, 4c, 12, 26
|
Feb. 21 |
First Midterm Exam |
Feb. 26 |
Induction |
§§ 5.1-5.2 |
§5.1:
10, 14, 30, 50, 52
|
§5.2:
4, 12, 30
|
|
Feb. 28 |
Recursive definitions |
§ 5.3 |
§5.3:
12, 18, 14, 26, 30
|
Mar. 5 |
Counting and the pigeonhole principle |
§§ 6.1-6.2 |
§6.1:
16, 26, 30, 44
|
§6.2:
4, 10, 16
|
|
Mar. 7 |
Permutations, combinations, binomials |
§§ 6.3-6.4 |
§6.3:
12, 24, 26, 28
|
§6.4:
10, 14, 16, 20, 24
|
|
Mar. 12 |
More permutations and combinations |
§ 6.5 |
§6.5:
16, 22, 26, 34, 38
|
Mar. 14 |
Probability begins! |
§§ 7.1-7.2 |
§7.1:
14, 28, 32
|
§7.2:
8, 16, 18, 28
|
|
Mar. 19 |
Bayes |
§§ 7.2-7.3 |
§7.3:
4, 10, 12
|
Mar. 21 |
Expected value and variance |
§ 7.4 |
§7.4:
10, 14, 18, 28
|
Apr. 2 |
Expected values and Review |
Apr. 4 |
Second Midterm Exam |
Apr. 9 |
Recurrence relations |
§§ 8.1-8.2 |
§8.1:
8, 10, 12, 14, 20
|
§8.2:
4ace, 8, 17
|
|
Apr. 11 |
Generating functions, inclusion-exclusion |
§§ 8.4-8.6 |
§8.4:
4dgh, 8cg, 12cd, 14, 18
|
§8.5:
8, 14, 20
|
§8.6:
2, 4, 8, 16
|
|
Apr. 16 |
Relations |
§ 9.1, § 9.3 |
§9.1:
10, 24, 38, 40
|
§9.3:
8, 10, 16
|
|
Apr. 18 |
More on relations |
§§ 9.4-9.5 |
§9.4:
2, 10, 14, 22
|
§9.5:
10, 16, 18, 24, 26
|
|
Apr. 23 |
Less on graphs |
§§ 10.1-10.2 |
§10.1:
16, 22
|
§10.2:
18, 24, 26, 30, 38
|
|
Apr. 25 |
More on graphs |
§§ 10.3-10.4 |
§10.3:
24, 28, 30, 32ad
|
§10.4:
20, 22, 28, 30
|
|
Apr. 30 |
Planar graphs |
§ 10.7 |
§10.7:
4, 6, 14, 18, 20
|
May. 2 |
Euler and Hamilton paths and circuits |
§ 10.5 |
§10.5:
10, 26, 46, 65 (with a careful write-up!)
|
May. 7 |
Review |
May. 9 |
Questions |
May. 17 |
Final Exam, 7-10PM |