a recursive formula is always based on a preceding value and uses A n-1 and the formula must have a start point (an A1) also known as a seed value.
unlike recursion, explicit forms can stand alone and you can put any value into the "n" and one answer does not depend on the answer before it. we assume the "n" starts with 1 then 2 then 3 and so on
arithmetic sequence: an = a1 + d(n-1) this does not depend on a previous value
It is often possible to find an explicit formula that gives the same answer as a given recursive formula - and vice versa. I don't think you can always find an explicit formula that gives the same answer.
what is the recursive formula for this geometric sequence?
-7
An explicit formula is a formula in which depicts relations between the sums over complex number zeros and over prime numbers. An example of an explicit formula is: _(t) = _log(_) + Re(_(1/4 + it/2)).
In this case, 22 would have the value of 11.
The recursive formula isU1 = 30Un+1 = Un + 30 for 1 < =n
no
Assuming each term is 3 MORE than the previous term t(n) = -13 + 3*n where n = 1, 2, 3, ...
It look like a Fibonacci sequence seeded by t1 = 2 and t2 = 1. After that the recursive formula is simply tn+1 = tn-1 + tn.
In order to answer the question is is necessary to know what the explicit formula was. But, since you have not bothered to provide that information, the answer is .
Type yourWhich choice is the explicit formula for the following geometric sequence? answer here...
x_n+1 = x_n / 4