# Introduction to Discrete Mathematics

### 2017–18–B

## Prof. Mikhail Muzychuk

## Course Content

Sets. Set operations and the laws of set theory. Power set. Cartesian product of sets.The rules of sum and product. Permutations, combination, distributions. The Binomial Theorem. The well-ordering principle: mathematical induction. The principle of inclusion and exclusion. The pigeonhole principle. Recurrence relations. Generating functions.Relations and functions. Properties of relations. Equivalence relations and their properties. Partial order. Functions and their properties. Injective, surjective functions. Function composition and inverse functions.Graph, subgraph, complements. Graph isomorphism. Euler`s formula. Planar graph. Euler trails and circuits. Trees.Propositional logic. Syntax of propositional logic. Logical equivalence. The laws of logic. Logical implication. Equivalence and disjunctive normal form. Predicate logic. Syntax of predicate logic. Models. Equivalence of formulas. Normal form.Algebraic structures. Rings, groups, fields. The integer modulo n. Boolean algebra and its structure.

### University course catalogue: 201.1.9661

## Students' Issues

- Class Representative
- נועה גל
- Aguda Representative
- רכזת סיוע אקדמי - הנדסה ב’ ומכינות - נופר שלוש
- Staff Observers