12. 12 points Using the iterative method (forward or backward substitution) solve the following recurrence relations...

 

Transcribed Image Text:

12. 12 points Using the iterative method (forward or backward substitution) solve the following recurrence relations with the given initial conditions. Show the steps of your calculation. Note: you may use the formulas from Figure 1. (a) an = an1 + 3, ag = 1 (b) an = an1 n, ag = 4 Sum - ark (r = 0) k=0 k=1 Ex*, \x| < 1 k = 0 _kxk1, \x| < 1 k = 1 Closed Form ar+1 al r - 1 n(n + 1) 2 n(n + 1)(2n + 1) 6 n2(n + 1)2 4 ,r #1 1 (1-x) Figure 1: Summation Formulas. 12. 12 points Using the iterative method (forward or backward substitution) solve the following recurrence relations with the given initial conditions. Show the steps of your calculation. Note: you may use the formulas from Figure 1. (a) an = an1 + 3, ag = 1 (b) an = an1 n, ag = 4 Sum - ark (r = 0) k=0 k=1 Ex*, \x| < 1 k = 0 _kxk1, \x| < 1 k = 1 Closed Form ar+1 al r - 1 n(n + 1) 2 n(n + 1)(2n + 1) 6 n2(n + 1)2 4 ,r #1 1 (1-x) Figure 1: Summation Formulas.

Answer rating: 100% (QA)

a Given recurrence relation an an1 3 with initial condition a0 1 Lets use forward substitution to ... View the full answer