CMSC 27100-1: Discrete Mathematics

Course description Autumn11: Monday, Wednesday, Friday 11:30am-12:20pm (RY 276)

Office hours. Instructor: Subhash Khot t-9khot@cs.uchicago.edu RY 257A Office hours: Mon 1:303:00 (and by appointment if urgent) Announcements:

TA1: Denis Pankratov TA2: Yuan Li pankratov@cs.uchicago.edu jsliyuan@gmail.com RY 278 RY 178 Office hours: Thu 9:00Office hours: Fri 11:00am. 9:00-11:00am.

The final exam details: Dec 5, 10:30-12:30, Ry 276 (same as the classroom). Closed book. Cumulative (i.e. based on material taught throughout the course ) . There will be a review class on Friday, Dec 2. Final homework: you can hand it in on Wed, or in the review class on Friday, or slide under my office door by Friday noon. It is recommended that you read chapters 1.6-1.7, 2.1-2.4, 4.1-4.3 before the first class. A brief overview of this material will be given in the first couple of classes. Note that the textbook is [Rosen 6th Ed] though 7th Ed. might also be available. It would not matter which edition you have (6th Ed. is preferable as my copy is 6th Ed).

Note: If you have questions about grading, you should talk to the TA who graded the assignment. Homeworks. There will be weekly homework assignments due at the beginning of class each Friday (except the first week and the Thanksgiving week). The first two assignments are already available, due on October 7 and 14 respectively. You are encouraged to work together on solving homework problems. All students must turn in their own write-up of the solutions. If you work with other people, you must put their names clearly on the write-up. In addition to the assignments, you are encouraged to solve exercises in [Rosen] for practice.
o o o o o o o

Assignment #1 Solutions Assignment #2 Solutions Assignment #3, Solutions Assignment #4, Solutions Assignment #5, Solutions Assignment #6, Solutions Assignment #7, Solutions

Graded by Yuan. Graded by Denis. Graded by Yuan. Graded by Denis Graded by Denis Graded by Yuan Graded by Yuan

Assignment #8, Solutions + Figure

To be graded by Denis

Note: The notation in solutions might be different from that used in class.

Exams. There will be a midterm and a final. Towards the final grade: assignments 50%, midterms 20%, final 30%. No extension for any assignment. If you fail to submit an assignment due to an emergency (e.g. hospitalization, unexpected travel), you would need to convince me that this was a genuine emergency, and I will give you credit equaling your average score for other assignments.
o o o

Midterm1 : Midterm2: Final:

Oct 24. Nov 18. Dec 5, 10:30-12:30, Ry 276.

Literature. We will follow Discrete Mathematics and Its Applications (6th Edition) by K. Rosen. Here is some other (optional) literature in case you are interested in advanced materials and challenging exercises.
o o o o o

J. Matousek, J. Nesetril, An Invitation to Discrete Mathematics, Oxford University Press, 2009. L. Lovasz, Combinatorial Problems and Exercises, AMS Chelsea Publishing, 2007. . S. Jukna, Extremal Combinatorics, Springer-Verlag, 2000. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, 2007. N. Alon, J. Spencer, The Probabilistic Method, Wiley-Interscience, 2008.

Progress. o 9/26, 9/28: Overview of proof techniques (direct proof, proof by contradiction/induction/case-analysis, existence and uniqueness, counterexamples etc). [Rosen, 1.6-1.7, 2.1-2.4, 4.1-4.3]. o 9/30, 10/3, 10/5, 10/7: Basic number theory: GCD, Euclids algorithm, prime factorization, modular arithmetic, Fermats little theorem, Chinese Remainder Theorem, RSA public-key cryptosystem. [Rosen 3.4-3.7]. o 10/10, 10/12, 10/14: Basic algorithms (binary search, bubble-sort, merge-sort, n log n sorting lower bound, Euclids GCD algorithm analysis, Big Onotation), Counting, Pigeonhole Principle. [Rosen 3.1-3.3, 5.1-5.5]. o 10/17, 10/19, 10/21: Counting, permutations and combinations, binomial theorem, Pascals identity, Vandermondes identity, distributing (in)distinguishable balls into (in)distinguishable bins. [Rosen 5.1-5.5]. o 10/26, 10/28: Inclusion-exclusion formula (# onto functions, # derangements), recurrence relations [Rosen 7.1-7.2, 7.4-7.6]. o 10/31, 11/2, 11/4: Recurrence relations: Tower of Hanoi, Fibonacci sequence, solving linear recurrence relations of degree 2 (distinct or equal roots), Catalan numbers. Generating functions. [Rosen 7.1-7.2, 7.4].

11/7, 11/9, 11/11: Graph theory: connectedness, trees, bipartite graphs, Eulerian graphs, planar graphs, Eulers formula for planar graphs. [Rosen, Chapter 9. We didnt do any applications]. 11/14, 11/16: Non-planarity of K_5 and K_{3,3}, directed graphs, acyclic graphs, decomposition into strongly connected components, Cayleys formula for counting #labeled trees (Pitmans proof) [Rosen, Chapter 9]. You may not find some of these topics in the textbook, but you can search on web/Wikipedia. 11/21, 11/23, 11/28, 11/30, 12/2: Probability: sample space, event, conditional probability, independent events, application to Ramsey numbers, random variable, expectation, variance. If time permits then Chebychevinequality, Chernoff inequality [Rosen, Chapter 6]. Last two lectures, most likely, review of the course material.