The slides will be posted as we go.
September 13 Introduction 01-Intro.pdf
September 15 Propositional Logic and Propositional Equivalence (Sec 1.1 & 1.2 (skim)) 02-PropositionalLogic.pdf
September 17 Predicates and Quantifiers (Sec 1.3) 03-PredicatesNQuantifiers.pdf
September 20 Nested Quantifiers (Sec 1.4) 04-NestedQuantifier.pdf
September 22 Nested Quantifiers cont.
September 24 Introduction to Proofs (Sec 1.5(skim) & 1.6) 05-Proofs.pdf
September 27 Proof Methods and Strategies (Sec 1.7) 06-ProofMethodsAndStrategy.pdf
September 29 Proof Methods and Strategies cont.
October 1 Sets (Sec 2.1) 07-Sets.pdf
October 4 Set Operations (Sec 2.2) 08-SetOperations.pdf
October 6 Functions (Sec 2.3) 09-Functions.pdf
October 18 Functions cont.
October 20 Functions cont.
October 22 Sequences and Summations (Sec 2.4) 10-SequencesNSummations-1.pdf
October 25 Sequences and Summations cont.10-SequencesNSummations-2.pdf
October 27 Growth of Functions (Sec 3.2) 11-GrowthOfFunctions-1.pdf
October 29 Growth of Functions cont. 11-GrowthOfFunctions-2.pdf
November 1 Mathematical Induction (Sec 4.1) 12-MathematicalInduction-1.pdf
November 1 Mathematical Induction cont. 12-MathematicalInduction-2.pdf
November 8 Strong Induction (Sec 4.2(skim)) 13-StrongInduction.pdf Recursive Definitions (Sec 4.3)
November 10 Recursive Definitions cont. 14-RecursiveDefinitions.pdf
November 12 Basics of Counting (Sec 5.1) 15-BasicsOfCounting.pdf
November 15 Permutations and Combinations (Sec 5.3) 16-PermutationsNCombinations.pdf
November 17 Binomial Coefficients (Sec 5.4) 17-BinomialCoefficient.pdf
November 19 Recurrence Relation (Sec 7.1) 18-RecurrenceRelations.pdf
November 22 Solving Linear Recurrence Relations (Sec 7.2)
November 24 Solving Linear Recurrence Relations cont. 19-SolvingLinearRecurrenceRelations.pdf
November 26 Relations and Their Properties (Sec 8.1) 20-RelationsNProperties.pdf
November 29 Closures of Relations (Sec 8.4) 21-ClosuresRelations.pdf
December 6 Equivalence Relations (Sec 8.5) 22-EquivalenceRelations.pdf
Recommended Exercises
1.1: 1,3,5,9,19,23,27,44,49,55-59
1.2: 1,3,4,5,7
1.3: 13,21,23,25,33,39
1.4: 1,3,9,12,21,25,27,39
1.5: 3,15,19,23
1.6: 1,11,17,33
1.7: 5,21,37,41
2.1: 1,5,7,13,19,25,35
2.2: 3,5,19,25
2.3: 3,5,15,23,45
2.4: 5,13,19,31,35
3.2: 1,19,23
4.1: 3,7,21,31,43
4.3: 9,13,23,45,57,59,61,62
5.1: 3,9,19,27,33,39,43,59
5.3: 3,5,7,9,12,14,17,19,21,23,28,33,43
7.1: 1,9,11,13,15,19
7.2: TBA
8.1: TBA
8.3: TBA
8.4: TBA
8.5: TBA
Other References
Norman L. Biggs. Discrete Mathematics. Oxford University Press, 2002.
Alan Doerr and Kenneth Lavasseur. Applied Discrete Structures for Computer Science. Science Research Associates, 1985.
Gary Haggard, John Schlipf and Sue Whitesides. Discrete Mathematics for Computer Science. Thomson, 2006.
Rod Haggarty. Discrete Mathematics for computing. Addison-Wesley, 2002.
Bernard Kolman, Robert C. Busby and Sharon Cutler Ross. Discrete Mathematical Structures. Pearson, 2004.
Edward Scheinerman. Mathematics: A Discrete Introduction. Thomson, 2006.
Daniel Solow. How to Read and Do Proofs: An Introduction to Mathematical Thought Processes. Wiley, 2002.
Andrew Wohlgemuth. Introduction to Proof in Abstract Mathematics. Saunders College Publishing, 1990.