MATH 141
Discrete Mathematics · 4 credits · Spring 2027
Requirements
PREREQUISITE: MATH 120
About this course
Discrete mathematics with computer science applications, emphasizing both computations and proofs; recursion and recursive definitions; mathematical, strong, and structural induction; topics from number theory, including primality, modular arithmetic, and congruences; topics from combinatorics, including permutations, combinations, and the Pigeonhole Principle; topics from graph theory, including types of graphs and trees, as well as their properties and applications.
Seat status as of Oct 3, 4:54 AM ET. Seats can change between refreshes.
No sections have been posted for this course in this term yet.