APPM 3170 Discrete Applied Mathematics Spring 2018

Sujeet Bhat
Lecture #001 (MWF 2–2:50, ECCR 116)
ECOT 338, MW 8:35 – 9:50
[email protected]

Course Goals: The main purpose of this course is to expose you to a wide variety of topics in discrete mathematics.
These topics include logic, proof methods, set theory, induction, well-ordering, algorithms, complexity, congruences,
basic and advanced counting techniques, recurrence relations and elementary graph theory. Mathematical writing
style, problem solving and proofs will be emphasized.(Prerequisite: APPM 2350)

Text: Discrete Mathematics and Its Applications, 7th ed, by K. H. Rosen

A- ≥ 90% B- ≥ 80% C- ≥ 70% D ≥ 60%

You must earn an average of 55% or better on your exams (midterms and final) in order to earn a D or better in the
course. After the final exam, if your exam scores average to less than 55%, it is not possible to earn a D or better
in the class. After the final exam, if your exam scores average to 55% or better, then your homework points will be
factored in to determine your course grade. (Note: It is possible to have a 55% average on the exams and still earn
a D or F in the course if your homework scores are low.)
Exams: There will be midterm exams given on Wednesday, February 21 and Wednesday, April 11. Please turn in 4
bluebooks by the second week of class.
Final: The final exam is on Wednesday, May 9 from 2 to 3:15 p.m. (This is a 75 minute final exam.)

Homework: Homework will be due approximately every week. You must show all work, correct solutions without
adequate justification will receive no credit. Late homework will not be accepted.
Special Accommodations: Any student eligible for and needing academic adjustments or accommodations because of
a disability, religious beliefs, or athletic conflict should speak to me by the third week of class.

E-mail Policy: If you e-mail me, in your e-mail subject please include the prefix “APPM 3170 - Spring 2018:”, followed
by a very short description of your e-mail. Failure to do this may result in a delayed response or no response at all.
Dropping the course: Advice from your department advisor is recommended before dropping any course. The last day
to drop a class in MyCUInfo is March 23rd, see http://www.colorado.edu/registrar/
Academic Honesty: Students can work in groups however, all work turned in must be your own. Violation of
the CU Student Honor Code (http://www.colorado.edu/policies/student-honor-code-policy) will result in
an automatic final grade of F in the course. All grading disputes must be resolved within one week of the grade
being returned to the class.
 Schedule for APPM 3170, Spring 2018 (Text: Rosen – 7th Ed.)
Week Date Section # Topic Homework HW/Due
Wed, Jan 17 1.1 1 Propositional Logic (Models of Thought) 1.1:2,3,8,11
1 HW#1
Fri, Jan 19 1.1,1.3 2 Propositional Equivalences (read 1.2) 1.1:18,20,23,27,31abc 01-24
Mon, Jan 22 1.3 3 More Propositional Equivalences 1.3:4a,8,9abc,13,27
2 Wed, Jan 24 1.4 4 Predicates and Quantifiers (Models of Argument) 1.4:3,5,8,12,32,43,60 HW#2
Fri, Jan 26 1.5,1.6 5 Nested Quantifers, Rules of Inference 1.5:2,3,8,15,28,45 01-31
Mon, Jan 29 1.7 6 Introduction to Proofs 1.7:2,6,18,27
HW#3
3 Wed, Jan 31 1.8 7 Proof Methods and Strategy 1.8:7,8,34 02-07
Fri, Feb 2 2.1 8 Set Theory 2.1:1,10,21,22,42
Mon, Feb 5 2.1,2.2 9 More on Sets 2.1:26,33a,46
HW#4
4 Wed, Feb 7 2.2 10 Set Operations 2.2:4bd,6,16e,18c,34,50a 02-14
Fri, Feb 9 2.3 11 Functions 2.3:2,8abg,12d,14c,71b
Mon, Feb 12 2.5 12 Cardinality (omit 2.4) Exam 1
5 Wed, Feb 14 3.1 13 Algorithms covers
Fri, Feb 16 3.1 14 More on Algorithms up to 2.5
Mon, Feb 19 3.2 15 Growth of Functions 3.1:42,45,52a
HW#5
6 Wed, Feb 21 Exam Exam 1 (in-class) 3.2:2abc,6,30c,57 02-28
Fri, Feb 23 3.3 16 Complexity of Algorithms 3.3:2,18a,20bc
Mon, Feb 26 4.1 17 Divisibility and Modular Arithmetic 4.1:2,8,12a,14b
HW#6
7 Wed, Feb 28 4.2 18 Integer Representations 4.2:2a,4a,48c 03-07
Fri, Mar 2 4.3 19 Prime Numbers 4.3:4ab,18a,21ab,22
Mon, Mar 5 4.3 20 Greatest Common Divisor 4.3:16c,23,24ab,26ab,50
HW#7
8 Wed, Mar 7 4.3,4.4 21 Bezout’s Theorem 4.4:1,6ab,8,10,12a 03-14
Fri, Mar 9 4.4,4.6 22 Solving Congruences, Cryptography
Mon, Mar 12 5.1 23 Well-Ordering Principle & Mathematical Induction 5.1:6,18,32,38,60
HW#8
9 Wed, Mar 14 5.2 24 Strong Induction 5.2:3,5,25ab,30 03-21
Fri, Mar 16 5.4 25 Merge Sort (omit 5.3, 5.5) 5.4:50,53,54
Mon, Mar 19 6.1,6.2 26 Basics of Counting, Pigeonhole Principle 6.1:4,16,26,32cd,44
HW#9
10 Wed, Mar 21 6.2 27 Dirichlet Approximation Theorem 6.2:2,6,40(not collected) 04-04
Fri, Mar 23* 6.3 28 Permutations & Combinations 6.3:8,18,22ac,30,34,40,43
11 Mar 26–30 Spring Break No Classes
Mon, Apr 2 6.3,6.4 29 More Perms & Combs/Binomial Coefficients Exam 2
12 Wed, Apr 4 6.4 30 Binomial Coefficients covers
Fri, Apr 6 6.5,8.2 31 Integer solutions, Recurrence Relations (omit 8.1) up to 6.3
Mon, Apr 9 8.2 32 Homogeneous Linear Relations 6.4:4,15,21,25
HW#10
13 Wed, Apr 11 Exam Exam 2 (in-class) 8.2:4ab,12,24a,25a,38a 04-18
Fri, Apr 13 8.2 33 Nonhomogeneous Linear Relations
Mon, Apr 16 8.2 34 More Nonhomogeneous LRs 8.2:24bc,26abce,28
HW#11
14 Wed, Apr 18 8.3 35 Divide-and-Conquer Algorithms 8.3:8ab,12,13,22,30 04-25
Fri, Apr 20 8.3 36 More Divide-and-Conquer Algorithms
Mon, Apr 23 8.4 37 Generating Functions 8.4:4cde,6d,8h,16(set up only),32
HW#12
15 Wed, Apr 25 8.4 38 More on Generating Functions 8.5:6a,8,14 05-02
Fri, Apr 27 8.5 39 Inclusion-Exclusion Principle 8.6:16,22,26
Mon, Apr 30 8.6 40 Applications of Inclusion-Exclusion Final
16 Wed, May 2 10.1,10.2 41 Graph and Graph Models covers
Fri, May 4 10.2 42 Graph Terminology & Special Types of Graphs up to 10.2
Final Wed , May 9 2–3:15pm Final (cumulative) - Wednesday, May 9th, 2 – 3:15 p.m.