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.Com
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) (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.
RELATED QUESTIONS
The first few square numbers are 1, 4, 9, and 16.
Find and solve a recurrence relation... (answered by ikleyn)
Define the a3 and a4 terms of the recurrence relation:... (answered by Edwin McCravy)
Discrete mathematics.
A colony of bats is counted every 2 months. The first four counts... (answered by Theo)
Find the general solution of the recurrence relation:
T(n) = 5T(n/4) - 4T(n/16) +... (answered by ikleyn)
Q.3 Find a particular solution to the recurrence.
an+1 − 2an + an−1 = 5 +... (answered by Edwin McCravy)
The question is in three parts, but I've solved the second two-thirds. I just don't know... (answered by ewatrrr)
Given that 1, 3, 7, … is a linear recurrence sequence, find its closed form.... (answered by Edwin McCravy)
$10000 is invested in an account earning 10.5% compound interest each year.
Right down... (answered by rfer)
An employee joined a company in 1987 with starting salary of 50,000. Every year this... (answered by Theo)