Answer:
61,940
Step-by-step explanation:
For a recursive sequence of reasonable length, it is convenient to use a suitable calculator for figuring the terms of it. Since each term not only depends on previous terms, but also depends on the term number, it works well to use a spreadsheet for doing the calculations. The formula is easily entered and replicated for as many terms as may be required.
__
The result of executing the given algorithm is shown in the attachment. (We have assumed that g_1 means g[-1], and that g_2 means g[-2]. These are the starting values required to compute g[0] when k=0.
That calculation looks like ...
g[0] = (0 -1)×g[-1] +g[-2} = (-1)(9) +5 = -4
The attachment shows the last term (for k=8) is 61,940.
EDIT:
2x + 0.75 = 13
Add like terms
2x= 13-0.75
2x= 12.25
x= 12.25/2
x=6.125
You can buy 6 whole shirts with $0.25 left over
Hope this helps! A thanks/brainliest answer would be appreciated :)
Answer:
m = 3/100
Step-by-step explanation:
211m + 16 = 4 + 611m
211m - 611m = 4 - 16
-400m = -12
m = -12/-400
m = 3/100
Answer:

Step-by-step explanation:
simplify
by putting the negative sign on the outside. 
find the LCM of the denominators. It is (x-1)(x-2). Multiply by the LCM:

Simplify:

solve: 
Answer:
It is either 2 or 4, I think it might 2, kind of hard to tell. Sorry if neither of my educative guesses are correct.
Step-by-step explanation: