General information

Instructor: Richard Eisenberg
Office Phone: 610-526-5061
Home Phone (emergencies only): 484-344-5924
Cell Phone (emergencies only): 201-575-6474 (no texts, please)
Office: Park 204
Office Hours: Tuesdays 1:30pm-3:30pm
If this doesn’t work, do not fret. Email instead.
Lecture: MW 10:10-11:30
Lecture Room: Park 229
Lecture Recordings: at Tegrity: access via Moodle; look for link on right side of screen.
GitHub Repo:
Piazza Q&A Forum:
Time TA Location
Tuesdays, 7-9pm Rose Lin ( Park 231
Mondays, 7-9pm My Nguyen ( Park 231
Mondays, 7-9pm Caroline Shen ( Park 231
Thursdays, 4-6pm Wenqi Wang ( Park 231
Tuesdays, 7-9pm Zhengyi Xu ( Park 231

Goals of course

By the end of this course, you will be able to…

During the course, you will…

This is a course in discrete mathematics, the branch of mathematics that underpins computer science and number theory. The word discrete means “individually separate and distinct”. Applied to mathematics, this word means that we will be studying the behavior of mathematical structures that can be considered as individual, distinct units: for example, we will study integers, not the real numbers; or we will study true and false, not the unit interval (that is, the range of numbers between 0 and 1).

A key part of any mathematical investigation is proof. In this course, we will do many proofs by induction, a powerful technique where local reasoning can be used to prove global properties. Along the way, we will also discuss a variety of discrete structures, including Boolean algebra, the natural numbers, sets, functions over sets, trees, and graphs. We will also use our knowledge to delve into combinatorics, the mathematics of counting; combinatorics underly much of probability and data science.

This course does not build on calculus or linear algebra. Instead, it explores separate areas of mathematics. Work in this course will be all pencil-and-paper; there will be no computer programming.


The required textbook for the course is:

Known errata for this book are posted.

Recommended reading:

These two books offer nice background and motivation for the material in this course.

And I can’t help but recommend