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.
Answer:
an apparent solution that must be rejected because it does not satisfy the original equation.
Step-by-step explanation:
Answer:
C
Step-by-step explanation:
Since "P" is -4, add POSITIVE 6.5 to it. It makes 2.5
hope it helps :D
Answer:
Step-by-step explanation:
The function is y = 17x. Then if x = 1, y = 17; if x = 2, y = 34, and so on, which agree with the table. The other questions are difficult or impossible to read. Please try to obtain and share better quality images.