|
Course description |
|
The course gives an introduction to discrete mathematical techniques and their applications. |
|
Prerequisites |
|
Basic combinatorial calculus. |
|
Program |
- Induction principle.
- Binomial coefficients and Newton formula.
- Recursive problems. Examples: Hanoi tower, Josephus problem.
- Recurrence relations. Generating functions. Examples: Fibonacci and Bernoulli sequences.
- Elementary number theory. |
|
Professor/Tutor responsible for teaching
|
|
Professor not available
|
|
Video professors |
|
|