Discrete mathematics MAA 103 (École polytechnique, Bachelor, 2017-2019)
Discrete Mathematics MAA 103 (Year 1) had 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 course started with elementary logic (e.g. quantifiers, different methods of proof), sets, and functions. The second part of the course introduced students to combinatorics and probability (on finite sets). The course consisted of 16 weeks (1h30 lecture and 1h30 exercise session per week).
Course material:- Presentation of the course
- Some Guidelines for Good Mathematical Writing (Su)
- Structure in Randomness
- Week 1 (Sets) : exercises - solutions
- Week 2 (Formal logic, truth tables, methods of proof) : exercises - solutions
- Week 3 (Quantified statements) : exercises - solutions
- Week 4 (Functions: injectivity, surjectivity, bijectivity) : exercises - solutions
- Week 5 (Functions (images and preimages of sets)) : exercises - solutions
- Week 6 (Notation Σ,Π , induction) : exercises - solutions
- Week 8 (Cardinality and combinatorics) : exercises - solutions
- Week 9 (Binomial coefficients) : exercises - solutions
- Week 10 (Permutations) : exercises - solutions
- Week 11 (Modelling with graphs: the Tower of Hanoi) : exercises - solutions
- Week 12 (Finite probability spaces) : exercises - solutions
- Week 13 (Combinatorics and probability) : exercises - solutions
- Week 14 (Independence and conditional probabilities) : exercises - solutions
- Week 15 (Review exercises) : exercises - solutions
- Additional exercises in combinatorics: exercises - solutions
- 2019-2020 : midterm exam (solutions) - final exam (solutions)
- 2018-2019 : midterm exam (solutions) - final exam (solutions)
- 2017-2018 : midterm exam (solutions) - final exam (solutions)