Course Code : | 1001WETDWI |

Study domain: | Mathematics |

Academic year: | 2019-2020 |

Semester: | 1st semester |

Contact hours: | 90 |

Credits: | 9 |

Study load (hours): | 252 |

Contract restrictions: | No contract restriction |

Language of instruction: | Dutch |

Exam period: | exam in the 1st semester |

Lecturer(s) | Stijn Symens |

At the start of this course the student should have acquired the following competences:

an active knowledge of

- competences corresponding the final attainment level of secondary school

an active knowledge of

- Dutch

- English

Elementary set theory

- The students have elementary knowledge of sets, functions and elementary logic.
- The students can apply the basic proving techniques (contraposition, contradiction, mathematical induction).
- The students can apply the basic combinatorial techniques, in particular in elementary knowledge
- The students know the different discrete probability distributions and can used them in an elementary context.
- The students can solve combinatorial problems by use of generating functions. moreover, a student can convert a recursive definition of a sequence into a closed formula by use of generating functions.

- sets, relations, functions

- mathematical induction

- counting methods : combinatorics and the principle of inclusion and exclusion

- finite probability

- elementary logic

Class contact teachingLectures Practice sessions

ExaminationWritten examination without oral presentation Written with oral presentation Closed book

Course Notes are available.

There exists a lot of good (and thick) books on Discrete Mathematics available.

-Stephen B Maurer en Anthony Ralston: Discrete Algorithmic Mathematics .

Stijn Symens

room G308

03 265 37 49

stijn.symens@uantwerpen.be