Running head: COMBINATION 1

Combination

Student name

Institutional affiliation
COMBINATION 2

Combination
Question 1
𝑥 2𝑛
using cos(x) :=∑𝑛≥0(−1)𝑛 (2𝑛)!

The coefficient of xn is x2n

Replacing x2n in cos(2x), the equation becomes Cos(2x2n)
Cos(2x2n) = cos2(x2n) – sin2(x2n)
= 2cos2(x2n) – 1
This equation is similar to the identity Cos(2x) = cos2(x) – sin2(x)
Thus, the LHS is equal to the RHS

Question 2
For A(x) = a1x + a2x2 + a3x3 + …
The sum of A(x) = ∑𝑛≥0 𝑎𝑛 𝑥 𝑛
(1 – A(x))-1 = (1 – a1x)-1 + (1 – a2x2)-1+ (1 – a3x3)-1 + … = ∑𝑛≥0(1 − 𝑎𝑛 𝑥 𝑛 )−1
Therefore, for all A(x) in the ring Q, there exist (1 – A(x))-1 in the same ring

Question 3
n
Multinomial coefficients of wn,k = (𝑛 )
1 n2 ….nk

n 𝑛!
Expressing the multinomial coefficients in terms of factorials gives wn,k = (𝑛 )=𝑛
1 n2 ….nk 1 !n2 !….nk !

However, the number of coefficients is given by (n+k-1

k−1
) = (n+k-1
n
)
n
Sum of the coefficients, (x1+x2…+xk)n =∑ (𝑛 ) 𝑥1 𝑛1 𝑥2 𝑛2 … 𝑥𝑘 𝑛𝑘
1 n2 ….nk

Thus, replacing (n+k-1

n
) results to nk

Single summation for wn,k is ∑𝑛,𝑘 n! 𝑥 𝑛 (𝑒 𝑘 – 1)𝑘

Question 4
4 a) Let cn be the number of compositions of n with an odd number of parts, each at least 2.
Show that the OGF of {cn} is
COMBINATION 3

𝑥2 − 𝑥3
𝑛
∑ 𝑐𝑛 𝑥 =
1 − 2𝑥 + 𝑥 2 − 𝑥 4
𝑛≥0

The number of compositions for n with k parts = (nk−1

−1
)
𝑛−1
generating function, g(x) = ∑𝑛≥2 (∑𝑘≥0 ( )) 𝑥 𝑛
2𝑘 − 1
𝑛−1
= 𝑥 2 ∑𝑛≥2 (∑𝑘≥0 ( )) 𝑥 𝑛−2
2𝑘 − 1
𝑛+1
= 𝑥 2 ∑𝑛≥2 (∑𝑘≥0 ( )) 𝑥 𝑛
2𝑘 − 1
𝑛+1
The equation (∑𝑘≥0 ( )) is the number of coefficients {1,…, n+1) with odd numbers.
2𝑘 − 1
𝑥 2 −𝑥 3
Thus, g(x) = 𝑥 2 ∑𝑛≥0 𝑐𝑛 𝑥 𝑛 = 1−2𝑥+𝑥 2 −𝑥 4

b) Recurrence relation
𝑥 2 −𝑥 3
f(Cn) = 1−2𝑥+𝑥 2 −𝑥 4

the series is polynomial, therefore, it has no specific roots

therefore, the recurrence relation is Cn = ACn-1 + BCn-2

Question 5
The generating functions for a series with one number = G(Hn;x) = ∑∞
n=0 Hn x
n

Thus, for three numbers x, y, z, G(Hn;x) = ∑∞ n n n

n=0 Hn x y z = G(n ;x, y, z)
3

G(n3;x, y, z) = ∑∞ 3 3 3 3 3 3
n=0 {(n x ) +(n y )+(n z )}

1 1 1 1 1 1
= x3 D3 [1-x] +xD [1-x] + y3 D3 [1-y] +yD [1-y] + z3 D3 [1-z] +zD [1-z]

3x3 x 3y3 y 3z3 z

= 4 + 3 + 4 + 3 + 4 +
(1-x) (1-x) (1-y) (1-y) (1-z) (1-z)3

(1+x)3 (1+y)3 (1+z)3

= + +
(1-x)4 (1-y)4 (1-z)4

(1+x)3 (1+y)3 (1+z)3

Thus, the lattice points are x = 4 ,y= 4 ,z=
(1-x) (1-y) (1-z)4
COMBINATION 4

Question 6
Let sn be the number of binary strings of length n in which the substring 0110 does not occur.
Find a simple expression for the OGF of {sn}.
Let the bit strings 0110 denote a,b,c,d
The ordinary generating function formula, G(An;x) = ∑∞
n=0 An x
n

Thus, OGF of {Sn) will be G(Sn;a,b,c,d)

n n n n
G(Sn;a,b,c,d) = ∑∞
n=0 Sn a b c d