Discrete Mathematics

This course covers a large variety of topics centered on discrete (non-continuous) mathematical structures that will prepare students for future study in the field of mathematics and computer science. Discrete Mathematics challenges students to go beyond their high school curriculum and introduces students to different topics in university-level mathematics through daily problem sets. Some of the topics covered include number theory, cryptography, complexity theory, combinatorics, the Pigeonhole principle, graph theory, Boolean algebra, and logic design. Students explore applications of discrete mathematics by studying modern public key cryptosystems such as RSA, Diffie-Hellman and ElGamal. Furthermore, students study the applications of graph theory by exploring planarity, shortest distance algorithms and isomorphism. Students enhance their proof writing skills by practicing mathematical induction, and proof by contradiction.