Help with generating function problem

beddytear
Messages
4
Reaction score
0
Hi.
I'm really struggling with this generating function problem. Any help would be greatly appreciated.

Question:
Find the generating function for the compositions (c1,c2,c3...,ck) such that for each i, ci is an odd integer at least 2i-1.

Second part of question:

Use the above solution to to find the number of compositions of a positive integer n into k parts (c1,c2...ck) such that for each i, ci is an odd integer at least 2i -1.
 
Physics news on Phys.org
The "generating function" for a list of numbers is, by definition, the power series having those numbers as coefficients.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Replies
4
Views
2K
Replies
1
Views
2K
Replies
13
Views
1K
Replies
1
Views
3K
Replies
1
Views
2K
Replies
17
Views
3K
Replies
1
Views
2K
Back
Top