A sequence can be represented by a generating function, which tells us a lot about its sequence. This especially comes in useful when the sequence does not have a (simple) explitic formula. It is possible to derive sequence’s asymptotic characteristics of coefficients from its generating function, which can be used for the coefficients’ representation. In this diploma thesis we present some asymptotic methods. These are then used on some concrete generating functions in a way that we calculate asymptotic formulas with these methods and compare approximation results. Formulas can be derived by different methods and/or have different number of parts. It turns out that asymptotic methods differ in simplicity and approximation accuracy.
|
