Logic: compound statements, conditional statements, predicates, quantifiers, methods of proof. Elementary number theory: divisibility, prime numbers, parity. Elementary set theory: operations, identities, cardinality, inclusion-exclusion principle. Mathematical induction. Combinatorial analysis: multiplication rule, permutations, orderings, combinations, the pidgeonhole principle, binomial coefficients. Binary relations, functions, equivalence relations, partial ordering relations.

The aim of this course is a first exposure to the theoretical framework of Computer Science. Upon completion of the course, students will have the ability

• to follow a basic proof;
• to state problems in formal language;
• to use basic proof techniques in elementary problems.

Not required.

1. Epp S.S.: 'Διακριτά Μαθηματικά με Εφαρμογές', Εκδόσεις Κλειδάριθμος, 2011, ISBN : 978-960-461-325-0 (in Greek).
2. Rosen K.H.: Διακριτά Μαθηματικά και Εφαρμογές τους, Εκδόσεις Τζιόλα, 5η έκδοση, 2008, ISBN : 978-960-418-144-5 (in Greek).
3. Liu C.L.: Στοιχεία Διακριτών Μαθηματικών Πανεπιστημιακές Εκδόσεις Κρήτης, 2009, ISBN: 978-960-524-072-1 (in Greek).

• Small quizzes in class
• Final exam

Face-to-face.