| Abstract [eng] |
Application of recurrence relations in mathematics and computer science is very widely used. To solve many task of combinatorics using recurrence relations, the task of n objects we can change with the task of the object (n - 1) and of this – task with object (n - 2) and etc. In turn reducing the number of the objects, finally we get the task that is not difficult to solve. When programming, always tries to split the task into more or less difficult to make a few simpler as well. For this purpose it is used to recursively functions. In generally, the application of recurrence relations to facilitate and simplify the combinatorics, discrete mathematics, probability theory, economic and other problems of solving. |
