Discrete Mathematics

Content:

Lectures:

  1. Sets, cardinality of sets, countable and uncountable sets.
  2. Binary relations on a set, equivalence.
  3. Binary relations on a set, partial order.
  4. Integers, Euclid (extended) algorithms.
  5. Relation modulo n, congruence classes Zn and operations on Zn.
  6. Algebraic operations, semigroups, groups.
  7. Matematical induction and its applications
  8. Matematical induction as a tool for solving recurrence relations.
  9. Solving non-homogeneous recurrence equations with constant coefficients.
  10. Binomial theorem and its applications, properties of combinatorial numbers.
  11. Combinatorics.
  12. Reserve.

Tutorials:

  1. Sets, cardinality of sets, countable and uncountable sets.
  2. Binary relations on a set, equivalence.
  3. Binary relations on a set, partial order.
  4. Integers, Euclid (extended) algorithms.
  5. Relation modulo n, congruence classes Zn and operations on Zn.
  6. Algebraic operations, semigroups, groups.
  7. Matematical induction and its applications
  8. Matematical induction as a tool for solving recurrence relations.
  9. Solving non-homogeneous recurrence equations with constant coefficients.
  10. Binomial theorem and its applications, properties of combinatorial numbers.
  11. Combinatorics.
  12. Reserve.

References:

Results from the Final test written can be found

  1. May 19th here.