2019–20–A
Course topics
Prerequisites: 20119531 Linear Algebra
Brief syllabus
-
Operations over sets, logical notation, relations.
-
Enumeration of combinatorial objects: integer numbers, functions, main principles of combinatorics.
-
Elementary combinatorics: ordered and unordered sets and multisets, binomial and multinomial coefficients.
-
Principle of inclusion and exclusion, Euler function.
-
Graphs: representation and isomorphism of graphs, valency, paths and cycles.
-
Recursion and generating functions: recursive definitions, usual and exponential generating functions, linear recurrent relations with constant coefficients.
-
(Optional) Modular arithmetics: congruences of integer numbers, $\mathbb{Z}_m$, invertible elements in $\mathbb{Z}_m$.
University course catalogue: 201.1.6201
Students' Issues
- Class Representative
- קטרין נחין
- Aguda Representative
- רכזת סיוע אקדמי - הנדסה א’ -עדי מילול
- Staff Observers