Discrete Mathematics MAA 103 (Year 1) has two main objectives: (i) teach fundamental concepts in discrete mathematics, which are the building blocks of many different areas of science and of advanced mathematics (ii) teach how to write proofs. The cours strarts with elementary logic (e.g. quantifiers, different methods of proof), sets, and functions. The second part of the course introduces students to combinatorics and probability (on finite sets).

The lectures will closely follow the textbook Mathematics: A Discrete Introduction (3rd Edition) by Scheinerman. For a different presentation and broader applications concerning computer science, one may have a look at Discrete Mathematics with Applications by Epp.

**Course webpage: **http://www.cmap.polytechnique.fr/~kortchemski/dmaths/

Discrete Mathematics (MAA103) begins by introducing students to the central notions needed to pursue advanced mathematics, such as elementary logic (e.g. quantifiers, different methods of proof), sets, and functions. The second part of the course introduces students to combinatorics and probability (on finite sets). Course material is supplemented with examples and applications, such as graphical modeling and generating functions.

- Teaching coordinator: Igor Kortchemski
- Teaching coordinator: Apolline Louvet
- Teaching coordinator: Milica Tomasevic
- Teaching coordinator: Benoit Tran