Scribd
Upload
2 views2 pages

Assingmner Exa

This document is an assignment for the MA4050 Combinatorics and Graph Theory course at the Indian Institute of Technology Hyderabad, due on November 18, 2024. It consists of ten questions that require proofs and solutions related to recurrence relations and their characteristic equations. The assignment emphasizes the relationship between roots of characteristic equations and the forms of solutions for sequences defined by these relations.

Uploaded by

allahabaduniversity111
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

Assingmner Exa

This document is an assignment for the MA4050 Combinatorics and Graph Theory course at the Indian Institute of Technology Hyderabad, due on November 18, 2024. It consists of ten questions that require proofs and solutions related to recurrence relations and their characteristic equations. The assignment emphasizes the relationship between roots of characteristic equations and the forms of solutions for sequences defined by these relations.

Uploaded by

allahabaduniversity111
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

INDIAN INSTITUTE OF TECHNOLOGY HYDERABAD

MA4050 - Combinatorics and Graph Theory


Assignment 1 Autumn 2024

Answer all the questions. Please submit the assignment before the class on
18-11-2024 (9AM). Late submission carry no marks. [10 marks]

1. Prove the following: Let c1 and c2 be real numbers. Suppose that r2 − c1 r − c2 = 0


has two real roots r1 and r2 . Then the sequence {an } is a solution of the recurrence
relation
an = c1 an−1 + c2 an−2
if and only if an = α1 r1n + α2 r2n for n = 0, 1, 2, . . . , where α1 and α2 are constants.
2. Solve the recurrence relation an = an−1 + 2an−1 with a0 = 2, a1 = 7.
̸ 0. Suppose that r2 −c1 r −
3. Prove the following: Let c1 and c2 be real numbers with c2 =
c2 = 0 has only one root r0 . Then the sequence {an } is a solution of the recurrence
relation
an = c1 an−1 + c2 an−2
if and only if an = α1 r0n + α2 nr0n for n = 0, 1, 2, . . . , where α1 and α2 are constants.
4. Solve the recurrence relation an = 6an−1 − 9an−2 with the initial conditions a0 = 1 and
a1 = 6.
5. Prove the following: Let c1 , c2 , . . . , ck be real numbers. Suppose that the characteristic
equation rk − c1 rk−1 − · · · − ck = 0 has distinct roots r1 , . . . , rk . Then a sequence {an }
is a solution of the recurrence relation an = c1 an−1 + c2 an−2 + . . . ck an−k if and only if
an = α1 r1n + α2 r2n + · · · + αk rkn , for n = 0, 1, 2, . . . where α1 , α2 , . . . , αk are constants.
6. Find the solution of the recurrence relation an = 6an−1 −11an−2 +6an−3 with the initial
conditions a0 = 2, a1 = 5 and a2 = 15.
7. Prove the following: Let c1 , c2 , . . . , ck be real numbers. Suppose that the characteristic
equation
rk − c1 rk−1 − · · · − ck = 0
has t distinct roots with multiplicity m1 , m2 , . . . , mt , respectively. Then a sequence
{an } is a solution of the recurrence relation
an = c1 an−1 + c2 an−2 + · · · + ck an−k
if and only if an = (α1,0 + α1,1 n + · · · + α1,m1 −1 nm1 −1 )r1n + (α2,0 + α2,1 n + · · · +
α2,m2 −1 nm2 −1 )r2n + · · · + (αt,0 + αt,1 n + · · · + αt,mt −1 nmt −1 )rtn1 for n = 0, 1, 2 where
αi,j are constants for 1 ≤ i ≤ t and 0 ≤ j ≤ mi − 1.

1
8. Prove the following: Suppose that the roots of the characteristic equation of a linear
homogeneous recurrence relation are 2, 2, 2, 5, 5, and 9. What is the form of the general
solution?

9. Suppose that {an } satisfies the linear nonhomogeneous recurrence relation

an = c1 an−1 + c2 an−2 + · · · + ck an−k + f (n)

where c1 , c2 , . . . , ck are real numbers, and f (n) = (bt nt + bt−1 nt−1 + · · · + b1 n + b0 )sn ,
where b0 , b1 , . . . , bt and s are real numbers.
Case (i): When s is not a root of the characteristic equation of the associated linear
homogeneous recurrence relation, there is a particular solution of the form (pt nt +
pt−1 nt−1 + · · · + p1 n + p0 )sn .
Case (ii): When s is a root of the characteristic equation of the associated linear
homogeneous recurrence relation with multiplcity m, there is a particular solution of
the form nm (pt nt + pt−1 nt−1 + · · · + p1 n + p0 )sn .

10. Compute the form of the particular solution of the linear nonhomogeneous recurrecne
relation
an = 6an−1 − 9an−2 + f (n)
when

(a) f (n) = 3n ,
(b) f (n) = n3n ,
(c) f (n) = n2 2n ,
(d) f (n) = (n2 + 1)3n .

You might also like