Which recursive formula can be used to generate the sequence shown, where f(1) = 5 and n > 1?
2 answers:
Answer:
The answer is C
Step-by-step explanation:
I just took the test and got it right
Hopefully this helps you
pls mark brainlest
You can try them out and see which one works.
a: f(2) = f(1) +6 = 5+6 = 11 . . . . . . not this one
b: f(1) = f(2) -6 = -1-6 = -7 . . . . . . not this one (5 ≠ -7)
c: f(2) = f(1) - 6 = 5 - 6 = -1 . . . . . this gives the right f(2)
d: f(2 = -6(f(1) = -6(5) = -30 . . . . not this one
_____
The appropriate choice is ...
... f(n +1) = f(n) - 6
— — — — —
You can also recognize that the next term is 6 less than the current one, so f(n+1) = f(n) - 6, which corresponds to the 3rd selection.
You might be interested in
The Divisor Is The Number That You Are Dividing With. Example:
12/4 = ?
4 Is The Divisor.
Yes you are right. it's 132
Answer:
11
Step-by-step explanation:
9
+ 2
<u> </u>
11
1 2 3 4 5 6 7 8 9 10 11
what the- to easy bro
Answer: w + 5
Step-by-step explanation: The sum of w and 5 translates into an algebraic expression form to w + 5.
Multiply both sides by 3 to get:
3r = sqrt(A)
Square both sides:
9r^2 = A