SOLUTION: Recursion, Recurrence Relations, and Analysis of Algorithms solve the recurrence relation subject to the basis step. 1. S(1) = 5 S(n) = S(n − 1) + 5 for n ≥ 2

Algebra ->  Test -> SOLUTION: Recursion, Recurrence Relations, and Analysis of Algorithms solve the recurrence relation subject to the basis step. 1. S(1) = 5 S(n) = S(n − 1) + 5 for n ≥ 2      Log On


   

Question 1191118: Recursion, Recurrence Relations, and Analysis of Algorithms
solve the recurrence relation subject to the basis step.
1. S(1) = 5
S(n) = S(n − 1) + 5 for n ≥ 2
Answer by Theo(13342) About Me  (Show Source):
You can put this solution on YOUR website!
i think this works like t his:

s(1) = 5
s(n) = s(n-1) + 5 for n >= 2

if n = 2, then:
s(2) = s(2-1) + 5 = s(1) + 5 = 5 + 5 = 10

if n = 3, then:
s(3) = s(3-1) + 5 = s(2) + 5 = 10 + 5 = 15

etc.