1. | Sets |
2. | Functions |
3. | Introduction to counting |
4. | Counting with bijections |
5. | Generating functions |
6. | Theory of generating functions (Milan Novaković) |
7. | Burnside's lemma |
8. | Polya's theorem |
Generating functions are powerful tools for solving a number of problems mostly in combinatorics, but can be useful in other branches of mathematics as well. The goal of this text is to present certain applications of the method, and mostly those using the high school knowledge.
In the beginning we have a formal treatment of generating functions, i.e. power series. In other parts of the article the style of writing is more problem-solving oriented. First we will focus on solving the recurrent equations of first, second, and higher order, after that develop the powerful method of "the snake oil," and for the end we leave some other applications and various problems where generating functions can be used.
No. | Title and link |
---|---|
9. | Introduction and main theorems |
10. | Recursive equations |
11. | The method of snake oil |
12. | Problems and solutions |