Discrete Mathematics and Algorithms(CSE611)

Lecture Notes: 19
Prepared by:
GURUPRASAD J (20105001)
SINDHURA.Y.R (201250865)
AKSHAY TAYAL (20135087)
ANGARA KRISHNA KAUSHIK (20162128)

19th September 2016

For a numeric function a = (a0,a1,a2,........ar,.......) we define the generating

(1)
which is convergent

1 Properties
1.If ar = zr,r ≥ 0,then

(2)

(3)

(4)

provided |z2| < 1

B(z) = αA(z) (5)

1
3.If c = a + b then C(z) = A(z) + B(z)
4.If br = αrar whereαisconstant

B(z) = A(αz) (6)

5.Let b = sia
(7)

(8)

(9)

6.Let c = s−ia

C(z) = z−i[A(z) − a0 − a1z − a2z2.... − ai−1zi−1] (10)

7.Let b = ∆a
(11)

8.Let d = ∇a
D(z) = A(z) − zA(z) (12)

9.For c = a ∗ b (convolution of a and b)

C(z) = A(z)B(z) (13)

2 Problems:1
Consider the problem of determining Cr , the number of sequences of length r
that are made of 3 English letters (x,y,z) and two Greek letters (α,β) with the first

2
partition of each sequence made up of English letters and the second partition
made up of Greek letters.

solution:

ar = 3r r ≥ 0 br =
2r r≥0

(14)

(15)
(16)

(17)

(18)

(19)
(20)

(21)

(22)

(23)

(24)
3 Problem:2
Using generating functions find the total number of distinct binary tress with n
nodes.

3
A binary tree Tn with n nodes is empty if n=0.If n ≥ 1 it is triple(Tl,Tc,Tn−l−s) where
r is the designated special node,called the root of the tree Tn; Tl is a binary tree
of l nodes called the left subtree of Tr, for some n=0,1,2,...........n-1 let xn denote
the numbe of distinct binary nodes of n-l-l nodes,called the right subtree of Tn
let Xn denotes the number of distinct binary tree with n nodes: n=0 X0=0 n=1
X1=1 n=2 X2=2 n=3 X3=5 ...... and so on. the reccurence relation of Xr is as
follows
n−l

Xn = X xl . xn−l−1 (25)
l=0

consider the generating function now

f(x) = a0 + a1x + a2x2 g(x) = b0 + b1x +

we have the condition that

if ,k=0,1,2...... then
Z(s)=X(s).Y(s).

let Y(s)=X(s) Z(s)=X(s).Y(s)

[yk−i = xk−i]
we have:

xk+1 =

Pki=0 xlxk−l =Pki=0 xixk−i.....(4)

4
sX2(s) = X(s) − 1

The cofficient of skin the series can be written as

5
Now, X(s) =

(take negative sign)

{replace n-1 by n}

{equation 6}
Deduction 1:- when n is large, using the striling’s formula :

n! =
From equation 6:

6
 when n is large. { equation 7}
Deduction 2:

4 Problem:3
Every particle inside a nuclear reactor split into two particle in each second.
suppose that one particle is injected into the reactor every second begining at t
= 0.
Express the number of particles in the reactor at the nthsecond as discrete
numeric function and gve a closed form for it.

Solution: At each second a particle genrates 2 particles without destroying itself,

Let xrbe the number of particles at rthsecond r ≥ 1

multiply zr xr.zr = 3xr−1.zr + zr

7
at r = 1 x1z = 3x0z +

z x2z2 = 3x1z2 + z2

.
.
.
xr.zr = 3xr−1zr + zr

——————————

x0 = 1

Rearranging the terms

using partial function

α(1 − z) + β(1 − 3z) = 1

Equating cofficiennt of z on both side

(α + β) − z(α + 3β) = 1

(α + 3β) = 0 α + β = 1

8
Cofficient of zris

x0 = 1,x1 = 4,x2 = 13,x3 = 40 ......