Discrete mathematics studies problems that can be broken up into distinct pieces. Some examples of these sorts of systems are letters or numbers in a password, pixels on a computer screen, the connections between friends on Facebook, and driving directions (along established roads) between two cities. In this course we will develop the tools needed to solve relevant, real-world problems. Topics will include: combinatorics (clever ways of counting things), number theory and graph theory. Possible applications include probability, social networks, optimization, and cryptography.
Delivery Method: Entirely remote (synchronous)
Prerequisites:Logic, Proofs, Set Theory and Algebra, or instructor’s permission.
Course Level: 4000-level
M/Th 10:00AM - 11:50AM (Full-term)
Maximum Enrollment: 20
Course Frequency: Every 2-3 years
Categories: All courses , Entirely Remote , Mathematics