Skip to main content


This course covers the mathematics that underlies most of computer science. Topics include mathematical induction; logical proof; propositional and predicate calculus; combinatorics and discrete mathematics; some basic elements of basic probability theory; basic number theory; sets, functions, and relations; graphs; and finite-state machines. These topics are discussed in the context of applications to many areas of computer science, such as the RSA cryptosystem and web searching.

The course meets Mondays, Wednesdays and Fridays from 1:25 to 2:15PM in Uris Hall G01.

Instructors: Graeme Bailey and Michael George