80 Discrete Mathematics RECURRENCE RELATIONS Definition ‘An equation that expresses a, viz., the general term of the sequence {a,} in terms of one or more of the previous terms of the sequence, namely ayy yy. yy for all integers m with m > mp, where my is a non-negative integer is called a recurrence relation for {a,} ot a difference equation. If the terms of a sequence satisfy a recurrence relation, then the sequence is called a solution of the recurrence relation, For example, let us consider the geometric progression 4, 12, 36 108, ..., the common ratio of which is 3. If {a,) represents this infinite sequence, we see that “ to the geometric sequence {4,}. However, the above recurrence relation does not represent a unique geometric sequence. The sequence 5, 15, 45, 135, also satisfies the above recurrence relation, In order that the recurrence relation 4, = 3ay,m 2 0 may represent a unique sequence, we should know one of the teims of the sequence, say, dy ~ 4. If ay = 4, then the recurrence relation represents the sequence 4, 12, 36, 108, ... The value ay = 4 is called the initial condition. If ay = 4, then from the recurrence relation, we get a, = 3(4). ay = 3%(4) and so on. In general when n > 0, a, = 4.3". This is called the general solution ofthe recurrence relation. ‘As another example, we consider the famous Fibonacci sequence 0,1,1,2,3,5,8, 18, 5 which can be represented by the recurrence relation Fyo2™ Pye + Fyy where n20 and Fy=0, F,= 1 =3 viz, a, . = 34,, 2 0 is the recurrence relation corresponding ne Definitions A recurrence relation of the form py * €) Oy * 62 yn ~ ns * 4 y= SC) is called a linear recurrence relation of degree k with constant coefficients, where cy, cy, ..- ¢, are Teal humbers and cy #0. The recutence relation is called finer, because each a, i raised to the power 1 and tere ae no products such as a,» ay Since a, i expressed in terms of the pervious terms of the sequence, the degree or order of the recurence relation is sad to be . In other words the degree is the diffrence between the greatest and least subscripis of the members ofthe Sequence occuring inthe recurence relation, TEfia) = 0, the recurrence relation is suid to be homogeneous; otherwise itis said tobe non-homogeneous Thc reareae eto given in ths dove exp ae Inca nogeces Note! Ccunence relations wth constant coucents and of depees 1 and 2 reapetively.Combinatorics 95 Hence, the general solution of the RR. is a,-e+ Zant n+ In et D@n+ Using ay = 1, we get e= 0 1 P= a(n + mn a, YP = Ema + 1) Qn + 0) Example 2.21 Use the method of generating function to solve the recurrence relation rt ism 1, given that ay = 1 Let the generating function of {a,} be G(x) = ¥ a,x" The given RR. is a, =3a,_, +1 wo Zax" BGs Bat on multiplying both sides of (1) by x" and summing up. ie, Gla) — ay = 3x Gay > ie, 1-39 Gaye » 1 1 2 OO) qayq=39 "T= = Laat + 2a ie, Gay= da ay + 0-39 Far - fed bee Be Bae Eta 4, = coefficient of xin G(x) a lgeet_ =tor'-p Example 2.22 Use the method of generating function to solve the recurrence relation a, = 4a,_, —4a,_~ 4" ; n 2 2, given that ay = 2 and a, = 8. Let the generating function of {a,} be G(x) = ¥ a,x” oa%6 Discrete Mathematics Multiplying both sides of the given R.R. by x" and summing up, we have Santa S air?4 Say guts Sarat ae = ie, (G(x) = ay = ayx} = 4e(G(@) = ay) = 42 GOO) ie, (ae + 4) Ga)= Ea 2 Oo 14(0-4x)? cw) (4x) (= 2x)? (1-4) = on splitting into partial fractions (-2x¥ te, b= Lagat wath +46 + oP He Sd = YL +2-Qx)+3- xP HHH Qe =] sant! e anne! Example 2.23 Use the method of generating function to solve the recurrence relation a, +1 ~ 84, 4 m2 Te aym Tay a8 Let the generating functions of {a,} be in 6g ae) = ¥ a,x" Multiplying both sides of the given RR. by x" and summing up, we have Ea, yx"-8 ¥ a,x" +16 Ea, yx"= 5 x)" m= wt a = ive 4 4613) = ay a2) -8{G(2) ~ ag} + 16x Gtx) = ie, (Be + 16) Gee) = ay - ax + Baye y= SM a—Baa)e | 4 (-4x) (l-4xy 14x (4x? 4x) 444) 0-4 ie, Ge) con using the values of ay and ayCombinatorics 7 eX” =(1-4x + 4x2) fa 242-3 (4x) +3. 4(dx? + + (+1) +2) Gay} iy = L101) 92) 4" = nn = 14" + n= Dyn 4) JV gna? + 3n + 2) = 40 +n) + P= SABE 4 3 2)— 4? +m) + OF — m) Lee nt =lot+m+sy4 2" J Example 2.24 Use the method of generating function to solve the 9m, n 20 recurrence relation a, . > — 4a, Let the generating function of {a,} be Ge) = E a,x" mo Multiplying both sides of the given R.R. by x" and summing up, we have Eo ayyox" 4S a,x"=9 Swe mo mo 0 {G(8) = ag = ayx} — 4600) =9¥ (ncn + 1) = mis" = 9[l = 2e #232 +] [y= 2 +38 + = 9x x 21 497 = 9x(l =? ie, (L-a)ayy = 4 4 He —9 x) ¥ d-0) d= Gy) = SHR, 18x? ___gat'_ 1-42-9048) daa) ay ax 98494 ~ 200229 “Gonsasamdean (-aP =x (On splitting into partial fractions)98 Discrete Mathematics g(t 207+ gt e297! Bae esa 92 = 6(1 =, where and c= B- + 2 ie. Sart = GE Mx+q ES eyes ino wo +5ZE@tyr-3 Leora Equating coefficients of x*, we get the general solution of the given R.R, as ane tre eye De swenxer nan he oon al needy 20) 1 Me CA W-3[a ened Example 2.25 Use the method of generating function to solve the = Ady, + 3n- 2%; 9 2 1, given that ap = 4 Let the generating function of {a,} be Go) = Lax" mo Multiplying both sides of the given R-R. by 2 and summing up, we have Lax" -4 Ea.) = 3 Envy ive, {G(x) ~ ag} = 4x Gx) = 6x + FY n(2xyr-! ie, (1-49) Ge) = S244 Le ay = 4) (28) 6x 9) = ——*__ (1-4 x)(1- 2x) 3 on splitting into partial fractions deat ie, ¥ a,x" = 10 ¥ 4x)" 3 ¥ Qy'-3 Em +) 20" Equating coefficients of x", we get 10x 4" 3 x 2" 3m + 1) x 2" 10x 4" — Bn + 6) x 2"