Discrete Mathematics Course

Discrete Mathematics

Time: 9:10 ~ 12:10 Thursday (Spring Semester)
Location: Room 107 of the CSIE Building


Unlike you [Bill Gates],
I had actually tried to do the reading.
---Steve Ballmer (1999)

In after years I have deeply regretted that
I did not proceed far enough at least to understand
something of the great leading principles of mathematics.
---Charles Darwin (1809-1882)

At best he could never have been a mathematician;
at worst he would never have cared to be one;
but he needed to read mathematics,
like any other universal language,
and he never reached the alphabet.
---Henry Adams (1838-1918)



To the students,

This course is on discrete mathematics. It covers combinatorics, boolean logic, computation theory, analysis of algorithms, probability, algebra, number theory, graph theory, set theory, and many other fields. Parts of the book should have been covered in high school and will be skipped or only briefly reviewed. I have in mind basic combinatorics, logic, and basic set theory.

It is never an easy job to teach discrete mathematics, because it touches so many areas of learning. Furthermore, unlike algebra, discrete mathematics does not seem to have a structure that can be said to form its foundation. But, for precisely the same reason, the subject is fascinating.

Please note that this course will be taught in English.


Notes [ 2001, 2002, 2003, 2004, 2012, 2013, 2014, 2015, 2016, 2017 ]

  1. 2017.02.23
  2. 2017.03.02
  3. 2017.03.09
  4. 2017.03.16
  5. 2017.03.23
  6. 2017.03.30
  7. 2017.04.06 mid-term exam
  8. 2017.04.13
  9. 2017.04.20
  10. 2017.04.27
  11. 2017.05.04
  12. 2017.05.11 mid-term exam
  13. 2017.05.18
  14. 2017.05.25
  15. 2017.06.01
  16. 2017.06.08
  17. 2017.06.15
  18. 2017.06.22 final exam

Book sections to be covered (based on the 5th ed.)


Examinations and grading