MACM-101-D3: Discrete Mathematics I [2004-3]
Course Notes and Readings
Week 13 (Nov 30, Dec 2, 2004)
readings:
5.1 (Cartesian Products and Relations),
5.2 (Functions: Plain and One-to-One),
5.2 (Onto Functions: Stirling Numbers of the Second Kind, up to and including Example 5.24)
from the textbook.
slides, handouts (6 slides per page)
Week 12 (Nov 23, 25 2004)
readings: Section 4.5 (The Fundamental Theorem of Arithmetic),
5.1 (Cartesian Products and Relations),
5.2 (Functions: Plain and One-to-One),
5.2 (Onto Functions: Stirling Numbers of the Second Kind, up to and including Example 5.24)
from the textbook.
slides, handouts (6 slides per page)
Assignment 4 (Due Dec 2, 2004, 14.15)
Requirements. This assignment should be dropped into the new assignment box
near the main campus entrance.
Week 11 (Nov 16, 18 2004)
readings: Section 4.1 (The Well-Ordering Principle: Mathematical Induction),
4.2 (Recursive Definitions) and 4.3 (The Division Algorithm: Prime Numbers)
from the textbook.
links:
Fibonacci numbers
(from Mathworld); see the comment about rabbits close to the top of the page.
Midterm 2 (Nov 9, 2004, 14.30--15.50, room 1105)
Practice midterm.
Try to solve all questions in the midterm in 1h 20min, then grade yourself.
Solutions.
Week 9 (Nov 2, 4 2004)
readings: Section 4.1 (The Well-Ordering Principle: Mathematical Induction) from the textbook.
slides, handouts (6 slides per page)
links:
- some
summation properties (look at Summation Arithmetic and Summation on
the Bounds), from math.com.
- the axiom (principle) of
mathematical induction, from Mathworld.
Week 8 (Oct 26, 28 2004)
readings: Chapter 1 (Counting) from the textbook (same as last week). Examples 3.7 and 3.14 from the textbook.
slides, handouts (6 slides per page)
Assignment 3 (Due Oct 28, 2004, 14.00)
Requirements. This assignment should be dropped into the new assignment box
near the main campus entrance.
Week 7 (Oct 19, 21 2004)
readings: Chapter 1 (Counting) from the textbook.
slides, handouts (6 slides per page)
Midterm 1 (Oct 14, 2004, 17.30--19.00, room 1105)
Practice midterm. Try to solve all questions in the midterm in 1h 30min, then grade yourself.
Week 5 (Oct 5, 7 2004)
readings: 3.1 (Sets and subsets), 3.2 (Laws of Set Theory) and 3.3 (Counting and Venn Diagrams) from the textbook.
Please note that examples 3.7 through 3.14 are not covered and not required.
slides, handouts (6 slides per page)
Week 4 (Sep 28,30 2004)
readings: 2.5 (Quantifiers, Definitions and the Proofs of Theorems; revisited),
3.1 (Sets and subsets) and 3.2 (Laws of Set Theory) from the textbook.
slides, handouts (6 slides per page)
links: The P vs. NP Problem (on the Clay Mathematics institute web site).
A $1 million prize is awarded for solving this problem.
Assignment 2 (Due Oct 7, 2004, 14.00)
Requirements.
Week 3 (Sep 21,23 2004)
readings (same as for week 2): Sections 2.4 (The Use of Quantifiers) and 2.5 (Quantifiers, Definitions and the Proofs of Theorems)
from the textbook.
Week 2 (Sep 14,16 2004)
readings: Sections 2.4 (The Use of Quantifiers) and 2.5 (Quantifiers, Definitions and the Proofs of Theorems)
from the textbook.
notes:
slides, handouts (6 slides per page)
Assignment 1 (Due Sep 23, 2004, 14.00)
Requirements.
Week 1 (Sep 7,9 2004)
readings: Sections 2.1 (Basic Connectives and Truth Tables), 2.2 (Logical Equivalence: The Laws of Logic)
and 2.3 (Logical Implication: Rules of Inference)
from the textbook.
notes:
slides, handouts (6 slides per page)