While continuous mathematics is the language of calculus and requires the use of real numbers, discrete mathematics is the language of formal logic, graph theory, and computer science, and it can be characterized by the use of integers. This course is an introduction to the tools and methods used in discrete mathematics. Topics include sets, logic, recursion and mathematical induction, trees, graphs, methods of proof, counting and probability, and relations and digraphs, with applications to computer science.