Scribd
Upload
2 views2 pages

Tut 7 NEW Solution

The document covers the topic of linear homogeneous recurrence relations of second-degree with constant coefficients in discrete mathematics. It provides examples of such relations, identifies which are homogeneous, and explains the characteristic polynomial and its roots. Additionally, it includes problems with solutions for determining coefficients and general solutions based on given recurrence relations.

Uploaded by

kase532
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

Tut 7 NEW Solution

The document covers the topic of linear homogeneous recurrence relations of second-degree with constant coefficients in discrete mathematics. It provides examples of such relations, identifies which are homogeneous, and explains the characteristic polynomial and its roots. Additionally, it includes problems with solutions for determining coefficients and general solutions based on given recurrence relations.

Uploaded by

kase532
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

Tutorials # 7 MATH163 - Discrete Mathematics

Week 7: Recurrence relations, characteristic polynomials, solving linear homogeneous recurrence


relations of second-degree in constant coefficients.

Problem 1. Identify which of the following is linear homogeneous recurrence relations of


Second-degree with constant coefficients:
Rules: 𝑎𝑛 = 𝑟 ∙ 𝑎𝑛−1 + 𝑠 ∙ 𝑎𝑛−2 + 𝑓(𝑛)
Where r and s are constants and 𝑓(𝑛) is some function of n.
 Homogeneous: if 𝑓(𝑛) = 0.
 Second-degree (order): because an defines as a function of the two separated terms preceding it.
 Linear: because the an-1 and an-2 appears to the first power and constant coefficients.

(a) 𝑎𝑛 = 2 ∙ 𝑎𝑛−1 + 5 ∙ 𝑎𝑛−2 + 𝑛2


Solution: is not homogeneous because 𝑓(𝑛) ≠ 0

(b) 𝑎𝑛 = −17 ∙ 𝑎𝑛−2


Solution: this is correct with r = 0 and s = -17

(c) 𝑎𝑛 = 8 ∙ 𝑎𝑛−1 + 11 ∙ 𝑎𝑛−3


Solution: this is not second-degree because an is not defines as a function of the two terms
preceding it.

(d) 𝑎𝑛 = 14 ∙ 𝑎𝑛−1 ∙ 𝑎𝑛−2


Solution: this is not linear because of product 𝑎𝑛−1 ∙ 𝑎𝑛−2 .

(e) 𝑎𝑛 = 2𝑛 ∙ 𝑎𝑛−1 + 5 ∙ 𝑎𝑛−2


Solution: this is incorrect, because the r is not constant coefficients since it depends on n.

(f) 𝑎𝑛 = 0.7 ∙ 𝑎𝑛−1 + 0.3 ∙ 𝑎𝑛−2


Solution: this is correct linear homogeneous recurrence relations of Second-degree with constant
coefficients.

(g) 𝑎𝑛 = 𝑎𝑛−1 + 1
Solution: is not homogeneous because 𝑓(𝑛) ≠ 0
Theorem: Let x1 and x2 be the roots of the polynomial x2 – rx – s. Then the solution of the recurrence
relation an = ran-1 + san-2 , n ≥ 2 is
1) 𝑎𝑛 = 𝑐1 𝑥1𝑛 + 𝑐2 𝑥2𝑛 𝑖𝑓 𝑥1 ≠ 𝑥2
2) 𝑎𝑛 = 𝑐1 𝑥 𝑛 + 𝑐2 𝒏𝑥 𝑛 𝑖𝑓 𝑥1 = 𝑥2 = 𝑥.
In each case, c1 and c2 are constants determined by initial condition

.Problem 2. Given the following recurrence relations


(a) 𝑎𝑛 = 5 ∙ 𝑎𝑛−1 − 4 ∙ 𝑎𝑛−2 , a0 = 1, a1 = 0,
(b) 𝑎𝑛 = 8 ∙ 𝑎𝑛−1 − 16 ∙ 𝑎𝑛−2 , a0 = -3, a1 = 2,

Write corresponding characteristic equations, and the roots and their multiplicities, write the form of
general solutions and determine the coefficients.

(a) 𝑎𝑛 = 5 ∙ 𝑎𝑛−1 − 4 ∙ 𝑎𝑛−2 , a0 = 1, a1 = 0

 0 = 𝑎𝑛 − 5 ∙ 𝑎𝑛−1 + 4 ∙ 𝑎𝑛−2
 The characteristic polynomial: x2 – 5x + 4 = 0 //
 The characteristic roots: x1 = 1 and x2 = 4 // (x – 1)·(x – 4)

 Since x1 ≠ x2 then the solution will be in this form 𝑎𝑛 = 𝑐1 (𝑥1 )𝑛 + 𝑐2 (𝑥2 )𝑛


 1) ∶ 𝑎0 = 𝑐1 (1)0 + 𝑐2 (4)0 = 1  𝒄𝟏 + 𝒄𝟐 = 𝟏
 2) ∶ 𝑎1 = 𝑐1 (1)1 + 𝑐2 (4)1 = 0  𝒄𝟏 + 𝟒𝒄𝟐 = 𝟎

1): (−1) ∙ (𝑐1 + 𝑐2 = 1)  −𝑐1 − 𝑐2 = −1 Coefficients:


(+) −1 4
2): 𝑐1 + 4𝑐2 = 0 3𝑐2 = −1  𝑐2 = 𝑎𝑛𝑑 𝑐1 =
3 3
4 −1
The solution is: 𝑎𝑛 = 3
∙ (1)𝑛 + 3
∙ (4)𝑛

(b) 𝑎𝑛 = 8 ∙ 𝑎𝑛−1 − 16 ∙ 𝑎𝑛−2 , a0 = -3, a1 = 2,

 0 = 𝑎𝑛 − 8 ∙ 𝑎𝑛−1 + 16 ∙ 𝑎𝑛−2
 The characteristic polynomial: x2 – 8x + 16 = 0
 The characteristic roots: x1 = 4 and x2 = 4 // (x – 4)·(x – 4)

 Since x1 = x2 (x1 = x2= x) then the solution will be in this form 𝑎𝑛 = 𝑐1 (𝑥)𝑛 + 𝑐2 (𝑛)(𝑥)𝑛
 1) ∶ 𝑎0 = 𝑐1 (4)0 + 𝑐2 (0)(4)0 = −3  𝒄𝟏 + 𝟎 = −𝟑
 2) ∶ 𝑎1 = 𝑐1 (4)1 + 𝑐2 (1)(4)1 = 2  𝟒𝒄𝟏 + 𝟒𝒄𝟐 = 𝟐

1) : 𝑐1 = −3 Coefficients:
14 7
2) : 4 (−3) + 4𝑐2 = 2  4𝑐2 = 14 𝑐1 = −3 𝑎𝑛𝑑 𝑐2 = =
4 2
7
The solution is: 𝑎𝑛 = (−3) ∙ (4)𝑛 + ∙ 𝑛 ∙ (4)𝑛
2

You might also like