Which recursive formula can be used to generate the sequence shown, where f(1) = 5 and n > 1? 5,–1, –7, –13, –19, ... f(n + 1) = f(n) + 6 f(n) = f(n +1) – 6 f(n +1) = f(n) – 6 f(n +1) = –6f(n)
Answers
Answered by
5
5 and -1 = 5-(-1) =5+1 =6.
-1 and -7 = -1 -(-7) =-1+7 =6.
-7 and -13 = -7 - (-13) = -7 + 13 =6.
-13 and -19 = -13 -(-19) = -13 +19 =6.
For the a(n-1) and a(n) we will get
f(n-1) - f(n) =6
=> f(n-1) -6 =f(n)
=> f(n) = f(n-1) - 6 this gives your recursive definition for n>1 .
and f(1) = 5.
Similar questions