數學 離散數學 Applied Combinatorics (6th Edition) 步驟2 步驟2／5

練習17 For the remainder of the solution, we observe from (1) that the
inhomogeneous part of the recurrence relation is equal to f (n) =
第7章，第7.4節，第308頁
2 + 3n, i.e. that it is a sum of two terms described by table:
Applied Combinatorics
ISBN ：9780470458389 f (n) particular solution
目錄 d B
dn ​ B1 ​n + B0 ​ ​ ​. (t)
解答 已驗證
dn2 B2 ​n2 + B1 n + B0 ​
步驟1 步驟1／5 edn Bdn

To solve the recurrence relation The constant 2 corresponds to the second row of (t) and linear term
3n to its third row—however, we note that both of these particular
an ​ − 5an−1 ​ + 6an−2 ​ = 2 + 3n , ​ (1)
solutions contain a simple constant term, the first one B and the
we start with its homogeneous part: second one B0 ​ so we merge them into one, denoted by, e.g. C .
Gathering these conclusions, the general form of our particular solution
an ​ − 5an−1 + 6an−2 ​ = 0 . ​ (2) is:

Since this part is linear, we guess a solution of form an ​ = Aαn and B1 ​n + C . ​ (4)
insert it into (2):

Aαn − 5Aαn−1 + 6Aαn−2 = 0/ ÷ Aαn−2

α2 − 5α + 6 ​ = 0 ​

−(−5) ± (−5)2 − 4 ⋅ 1 ⋅ 6 ​ 5 ± 25 − 24 ​ 5 ± 1
α1,2 =
​ ​ = ​ = ​ ,
2 2 2

implying that the two values of α are

5−1 5+1
α1 ​ = ​ = 2 and α2 ​ = = 3 .​
2 2
Thus, the homogeneous part of the solution is a sum of two terms:

a n ​ = A1 ​ ⋅ 2 n + A2 ​ ⋅ 3 n . ​ (3)
步驟3 步驟3／5 步驟4 步驟4／5
The total solution to our recurrence relation is a sum of the The final equation in (6) is a polynomial one so we equate its sides in
homogeneous part (3) and a particular one (4): terms of different powers of n:

an ​ = A1 ​ ⋅ 2n + A2 ​ ⋅ 3n + B1 ​n + C . ​ (5) n1 : 2B1 ​ = 3
​ ​ (7)
To determine the constants B1 and C in (5), we insert it back into the
​
n0 : 2C − 7B1 ​ = 2 .
initial recurrence relation (1): 3
From the first equation in (7), we conclude that B1 ​ = 2 and then from
(A1 ​ ⋅ 2n + A2 ​ ⋅ 3n + B1 ​n + C ) − the second that:
− 5 (A1 ​ ⋅ 2n−1 + A2 ​ ⋅ 3n−1 + B1 ​(n − 1) + C ) + 3 25 25 ​
2C = 2 + 7 ⋅ ​ = ​ ⟹ C = ​ .
+ 6 ( A1 ​ ⋅ 2 n−2
+ A2 ​ ⋅ 3 n−2
+ B1 ​(n − 2) + C ) = 2 2 4
= 2 + 3n Thus, our solution (5) turns into:
⎛ ⎞ ⎛ ⎞
0 0
3 25
4 − 10 + 6 ​ A1 ​ ⋅ 2n−2 + ​9 − 15 + 6 ​ ​ A2 ​ ⋅ 3n−2 + an ​ = A1 ​ ⋅ 2n + A2 ​ ⋅ 3n + ​n + ​ . ​ (8)
⎝ ⎠ ⎝ ⎠
​ ​ ​ (6) 2 4

(B1 ​n − 5B1 ​n + 6B1 ​n) +

(C + 5B1 ​ − 5C − 12B1 ​ + 6C ) =
= 2 + 3n
⟹ 2B1 ​n + (2C − 7B1 ​) = 3n + 2 .
 步驟5 步驟5／5
Before checking the validity of (7), we note that constants A1 ​ and A2 ​
remain undetermined since to do so, one ought to supply our
recurrence relation (1) with two initial values.

Inserting (8) into the LHS of said relation, we find that the solution is
indeed correct:

3 25
an ​ − 5an−1 ​ + 6an−2 ​ = (A1 ​ ⋅ 2n + A2 ​ ⋅ 3n + ​n + ​) +
(8)
2 4
3 25
− 5 (A1 ​ ⋅ 2n−1 + A2 ​ ⋅ 3n−1 + ​(n − 1) + ​)
2 4
3 25 ​
+ 6 (A1 ​ ⋅ 2n−2 + A2 ​ ⋅ 3n−2 + ​(n − 2) + )
2 4
⎛ ⎞ ⎛ ⎞
0 0

= 4 − 10 + 6 ​ ​ A1 ​ ⋅ 2 n−2
+ 9 − 15 + 6 ​ ​ A
⎝ ⎠ ⎝ ⎠
​ ​
​

3 15 18 25 15 125
+ n ( ​ − ​ + ​) + ( ​ + ​ − ​− 1
2 2 2 4 2 4
6 25 + 30 − 125 − 72 + 150
= ​n + ​
2 4
8
= 3n + ​
4
= 2 + 3n . ✓

練習16 練習18

隱私 服務條款