Generating functions and summation

In summary, the conversation discusses the concept of generating functions and how they can be used to compute the sum of a sequence by evaluating the function at a specific value. It also raises the question of whether this method can be applied to any sequence of weights and if there exists a real number that can be used to compute the sum. The speaker has not spent much time on this topic but is interested in any thoughts or insights on it.
  • #1
Pere Callahan
586
1
Hello this is something that just crossed my mind:

For every real sequence [itex](a_n)_{n\geq 1}[/itex] we can define the generating function
[tex]
A(z)=\sum_{n=1}^\infty{a_nz^n}.
[/tex]
and this definition suggests that we can compute the sum of the sequence by evaluating A at 1:
[tex]
A(1)=\sum_{n=1}^\infty{a_n}
[/tex]
provided the sum converges.

This made me wonder if for any sequence of weights [itex](w_n)_{n\geq 1}[/itex] there is a real number x such that we can compute the sum
[tex]
\sum_{n=1}^\infty{w_na_n}
[/tex]
as A(x).

I haven't spent much time on this, but I would be very interested in any thoughts on the topic.

Thanks,
Pere
 
Physics news on Phys.org
  • #2
No. w_1=1 and w_2=0 shows it's impossible, as [tex]w_n = w_1^n[/tex].
 

1. What is a generating function?

A generating function is a mathematical concept used to represent a sequence of numbers or coefficients as a power series. It is usually denoted by a function, such as G(x), where the coefficients of the power series correspond to the terms of the sequence.

2. How are generating functions used in summation?

Generating functions can be used to find closed-form solutions for summation problems. By manipulating the generating function using techniques from calculus, we can often extract the coefficients of the power series, which represent the terms of the sum.

3. What is the difference between ordinary and exponential generating functions?

Ordinary generating functions are used to represent sequences of numbers, while exponential generating functions are used to represent sequences of combinatorial objects. The main difference is that exponential generating functions include an extra variable that keeps track of the size of the objects in the sequence.

4. What are some common applications of generating functions?

Generating functions have many applications in mathematics, computer science, and physics. They can be used to solve recurrence relations, count objects with certain properties, and analyze the behavior of algorithms. They are also used in probability theory and statistical mechanics.

5. Are there any limitations to using generating functions?

Generating functions can be powerful tools, but they may not always provide a practical or efficient solution to a problem. They may also be limited by the complexity of the generating function or the difficulty in manipulating it. Additionally, generating functions may not always exist for a given sequence or problem.

Similar threads

Replies
3
Views
237
Replies
6
Views
678
Replies
2
Views
786
Replies
1
Views
1K
Replies
15
Views
2K
Replies
4
Views
745
Replies
2
Views
881
Replies
3
Views
913
Replies
14
Views
2K
Back
Top