SOLUTION: I need to find the closed form of this recursive function: a(n)= 5*a(n-1) where a(0) is the initial value?

SOLUTION: I need to find the closed form of this recursive function: a(n)= 5*a(n-1) where a(0) is the initial value?

Algebra.Com

Question 62313: I need to find the closed form of this recursive function: a(n)= 5*a(n-1) where a(0) is the initial value?
Answer by joyofmath(189) (Show Source): You can put this solution on YOUR website!
I need to find the closed form of this recursive function: a(n)= 5*a(n-1) where a(0) is the initial value?
Let's look at a few terms of the series to look for the pattern:
.
.
.
.
The pattern is that .
RELATED QUESTIONS
Find the closed form of the following recursive function: a(n)=5*a(n-1) where a(0) is the (answered by joyofmath)

I am working with recursive functions. I do not understand the examples given in the... (answered by stanbon)

Find the 1st 5 values of the recursive function, then find their 1st and 2nd differences, (answered by drk)

Consider the recursive rule u(n) =0.85u(n-1) +147 [This is u sub n and 0.85 u sub n-1] (answered by KMST)

The following function defines a recursive sequence: f(0) = -4 f(1) = 12 f(n) =... (answered by jim_thompson5910)

The recursive formula for the term of a particular sequence is given by An=A(n-1)+3 where (answered by richwmiller)

I got stuck while solving this question: A quantity N is decreasing such that at time (answered by greenestamps)

find the first five values of the recursive function f(1)= 5; f(n) = f(n-1) +... (answered by stanbon)

Let A_0 = 0 A_1 = 1 A_n = A_{n - 1} + A_{n - 2} for n ge 2 There is a unique... (answered by CPhill)