MATHUA.120: Discrete Mathematics Spring 2012
Class Time/Location 
Tuesday, Thursday 2:00pm3:50pm, 25 West 4th Street, Room C8 
Instructor 
Andreas Kloeckner 
Office 
Courant Institute, Warren Weaver Hall, Room 1105A 
Office Hours 
Tuesday 11am12pm, Thursday 1pm2pm 
Class Webpage 

Email Listserv 
http://lists.tiker.net/listinfo/discretespring12, discretespring12@tiker.net, archive 
Contents
Topics and goals
Our major goal will be to familiarize ourselves with some of the important tools of discrete mathematics.
 Mathematical language, logic, writing, and proof
 Set theory
 Functions and Relations
 Combinatorics and discrete probability
 Graph theory and trees
Text
Discrete Mathematics: Mathematical Reasoning and Proof with Puzzles, Patterns, and Games, by Douglas E. Ensley and J. Winston Crawley. Wiley, ISBN 0471476021
The book has a rather helpful companion web site which we will be using on occasion.
Assessment
 Homework
 will be assigned weekly (generally assigned and collected on Tuesdays). The homework assigned one Tuesday will include material taught the following Thursday. I'd like to encourage you to read the relevant sections of the book to a) get started on the homework early and b) prepare for the upcoming class. In fairness to the other students in the course, late homework will generally not be accepted. We will, however, drop the lowest homework score in computation of final grades. Please talk to me in cases of emergency.
 Quizzes
 There will be five quizzes. They are tentatively scheduled as indicated in the syllabus below. Quizzes will start at the beginning of class and run for about 1520 minutes. We will also drop the lowest quiz.
 Midterm
 There will one midterm exam. (See calendar below)
 Final
 The cumulative final examination for this course is scheduled as indicated on the calendar below. I will not be able to accommodate early finals for nonacademic, nonemergency reasons. Please plan your travel schedule accordingly.
Please talk to me ahead of time if you have a scheduling issue with any quiz or exam.
Grades will be computed by a weighted average:
Homework 
Quizzes 
Midterm 
Final 
10% 
20% 
30% 
40% 
Final scores will be converted to letter grades beginning with the following scale:
93 
90 
87 
83 
80 
75 
65 
50 
A 
A 
B+ 
B 
B 
C+ 
C 
D 
As for a curve, these cutoffs might be adjusted, but only in the downward direction (to make letter grades higher).
On the homework, each problem will be worth three points, assigned as follows:
Points 
Description of Work 
3 
Work is completely accurate and essentially perfect. Work is thoroughly developed, neat, and easy to read. Complete sentences are used. 
2 
Work is good, but incompletely developed, hard to read, unexplained, or jumbled. Answers which are not explained, even if correct, will generally receive 2 points. Work contains the 'right idea' but is flawed. 
1 
Work is sketchy. There is some correct work, but most of the work is incorrect. 
0 
Work minimal or nonexistent. Solution is completely incorrect. 
For the purposes of assembling the final grade, the grade on each homework set is converted to a percentage of all achievable points, on a scale from 0 to 100.
Homework
 Teaching/DiscreteMathSpring2012/HomeworkSet00
 Teaching/DiscreteMathSpring2012/HomeworkSet01
 Teaching/DiscreteMathSpring2012/HomeworkSet02
 Teaching/DiscreteMathSpring2012/HomeworkSet03
 Teaching/DiscreteMathSpring2012/HomeworkSet04
 Teaching/DiscreteMathSpring2012/HomeworkSet05
 Teaching/DiscreteMathSpring2012/HomeworkSet06
 Teaching/DiscreteMathSpring2012/HomeworkSet07
 Teaching/DiscreteMathSpring2012/HomeworkSet08
 Teaching/DiscreteMathSpring2012/HomeworkSet09
 Teaching/DiscreteMathSpring2012/HomeworkSet10
 Teaching/DiscreteMathSpring2012/HomeworkSet11
Tentative Calendar
Week 
Day 
Book Section 
Topic/Notes 
1 
1/24 
1.1 
First Examples 
1/26 
1.2 
Number Puzzles and Sequences 

2 
1/31 
1.3 
Truthtellers, Liars, and Propositional Logic 
2/2 
1.4 
Predicates 

3 
2/7 
1.5 
Implications 
2/9 
2.1 
Quiz; Mathematical Writing 

4 
2/14 
2.2 
Proofs about Numbers 
2/16 
2.3 
Mathematical Induction 

5 
2/21 
2.5 
Contradiction and the Pigeonhole Principle 
2/23 
3.1, 3.2 
Set Definitions and Operations 

6 
2/28 
3.3 
Quiz; Proving Set Properties 
3/1 
3.4 
Boolean Algebra 

7 
3/6 
Review 

3/8 
Midterm on 1.13.3 

8 
3/13 
Spring Recess (no class) 

3/15 
Spring Recess (no class) 

9 
3/20 
4.1 
Definitions of Functions, Diagrams 
3/22 
4.2 
Relations, Inverses, Composition 

10 
3/27 
4.3 
Properties of Functions and Set Cardinality 
3/29 
4.4 
Quiz; Properties of Relations 

11 
4/3 
4.5 
Equivalence Relations 
4/5 
5.1, 5.2 
Intro to Combinatorics, Basic Rules for Counting 

12 
4/10 
5.3 
Cominatorics and the Binomial Theorem 
4/12 
5.4, 5.5 
Binary Sequences, Recursive Counting 

13 
4/17 
6.1, 6.2 
Quiz; Intro to Probability, Sum and Product Rules 
4/19 
6.3 
Probability in Games of Chance 

14 
4/24 
7.1 
Graph Theory 
4/26 
7.2 
Proofs about Graphs and Trees 

15 
5/1 
7.3 
Quiz; Isomorphism and Planarity 
5/3 
Review 

16 
5/15 
Final Exam (2pm3:50pm) 
(see also the academic calendar)