Math 327, Discrete Mathematics, Spring 2007

Week Two, January 22 - 26, 2007

• Homework 1, due January 29
• Monday: intersection, union, symmetric difference, power set, ordered pairs. §2.2
• Wednesday: Relations (binary), equivalence relations §2.3, §2.4

Week Three, January 29 - February 2, 2007

• Homework 2, due February 7
• Monday: Equivalence class. § 2.4 (cont.)
• Wednesday: Partial orders and Hasse Diagrams § 2.5

Week Four, February 5 - 9, 2007

• Monday: Functions, one-to-one, onto, inverse. § 3.1
• Wednesday: Composition, inverse, cardinality. § 3.2, 3.3
• Homework 3, due February 14

Week Five, February 12 - 16, 2007

• Monday: The division algorithm § 4.1.
• Wednesday: Snow Day.
• Some review problems I fixed a type in problem 4.

Week Six, February 19 - 23, 2007

• Monday: Review
• Wednesday: Midterm I
• End of sixth week is last day to drop a course without a grade

Spring Recess, March 11-18

Week Nine, March 19 - 23, 2007

• Monday: Induction § 5.1
• Wednesday: Recursively Defined Sequences § 5.2
• Homework 6, due March 28

Week Ten, March 26- 30, 2007

• Monday: Homogeneous Linear Recurrence Relations § 5.3
• Wednesday:Nonhomogeneous Linear Recurrence Relations § 5.3
• Homework 7, due April 4
• We are skipping § 5.4

Week Eleven, April 2 - 6, 2007

• Monday: Combinatorics using reccurence relations: Problem 22 on page 175. Inclusion/Exclusion, §6.1.
• Wednesday: Multiply for independent choices. §6.2. The pigeonhole principal. §6.3.
| suggested problems

Week Thirteen, April 16 - 20, 2007

• Monday: Review. The midterm will cover §4.1-4, just the chinese remainder theorem from §4.5, §5.1-3, §6.1-3. It will not formally cover §7.1-2, but you may find those sections useful in doing problems like a card problem such as 6.2.16.
• Wednesday: Midterm II