In this introductory lesson on discrete math, the focus is on the common thread of counting that runs through disparate fields like graph theory, combinatorics, and logic. The class is about tackling hard counting problems, sometimes dealing with things that appear to be separate but are actually the same. The lecture concludes with an example of a proof by contradiction, a clever way to show that the square root of 2 can't be written as a fraction, and the importance of convincing others that something is true through a rigorous argument.
Learn what discrete math is, what problems are solved in this course, and what implications they have.
More information about this course:
http://www.aduni.org/courses/discrete
Licensed under Creative Commons Attribution ShareAlike 2.0:
http://creativecommons.org/licenses/by-sa/2.0/