Logic · Sets · Counting · Graphs

Discrete Mathematics

Course notes on logic and proof, sets and functions, number theory, induction, counting, probability, relations, graphs, trees, Boolean algebra, and models of computation.

Browse the topics View on GitHub

A graph whose vertices are colored with four colors so that no two neighbors share a color
A map colored with four colors
Four colors are always enough to color any map so that no two neighboring regions share a color: one of the most famous results in discrete mathematics, and the first major theorem proved with the help of a computer. Four-color graphic by Inductiveload

Topics

Topic 0 Some Background: Logs, Modulus, and More Topic 1 The Foundation: Logic and Proofs Topic 2 Basic Structures: Sets, Functions, Etc. Topic 3 Algorithms Topic 4 Number Theory and Cryptography Topic 5 Induction and Recursion Topic 6 Counting Topic 7 Discrete Probability Topic 8 Advanced Counting Techniques Topic 9 Relations Topic 10 Graphs Topic 11 Trees Topic 12 Boolean Algebra Topic 13 Modeling Computation

Other Material

Fall 2018 Syllabus Fall 2018 Course Outline Fall 2018 TA Hours Practice Homework Sets Archive Past Tests and Quizzes Project Algocynfas