Generating function: Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (New entry, just a start, more later) |
imported>David E. Volk m (subpages) |
||
Line 1: | Line 1: | ||
{{subpages}} | |||
In [[mathematics]], a '''generating function''' is a [[function (mathematics)|function]] for which the definition "encodes" values of a sequence, allowing the application of methods of [[real analysis|real]] and [[complex analysis]] to problems in [[algorithmics]], [[combinatorics]], [[number theory]], [[probability]] and other areas. | In [[mathematics]], a '''generating function''' is a [[function (mathematics)|function]] for which the definition "encodes" values of a sequence, allowing the application of methods of [[real analysis|real]] and [[complex analysis]] to problems in [[algorithmics]], [[combinatorics]], [[number theory]], [[probability]] and other areas. | ||
Revision as of 13:42, 8 March 2009
In mathematics, a generating function is a function for which the definition "encodes" values of a sequence, allowing the application of methods of real and complex analysis to problems in algorithmics, combinatorics, number theory, probability and other areas.
Let (an) be a sequence indexed by the natural numbers. The ordinary generating function may be defined purely formally as a power series
where for the present we do not address issues of convergence.
The exponential generating function may be defined similarly as a power series