###
Course overview

Welcome to Discrete Mathematics! This course will serve as an introduction to many of the structures and concepts that form the theoretical foundation of computer science. Additionally, this course will serve as an introduction to the art of proving mathematical statements in a rigorous manner. The topics include (but are not limited to) formal logic, proof techniques, set theory, combinatorics, recurrence relations, and graph theory.

###
Learning outcomes

By the end of this course students will be expected to be able to do the following:

- Describe mathematical structures using sentences in propositional and predicate logic
- Write concise and rigorous proofs using direct proofs, proof by contradiction, and mathematical induction
- Reason about properties of graphs
- Determine the size of certain sets using various counting techniques
- Write and understand the uses for recurrence relations
- Reason about divisibility and cryptographic properties of the integers

This list is neither exhaustive nor set in stone.

###
Instructor

**Name**: Arjun Chandrasekhar (he/him/his)

**Lecture**: Tuesday/Thursday from 11:30 am - 12:45 pm in Olin 323

**Email**:

chandrasa@southwestern.edu
**Student Hours**: Monday/Wednesday/Friday from 11:00 am - 2:00 pm in FJS 310 (the math/CS common room)

###
Course Links

Here is a

tentative calendar for the course.