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.
Here’s the answer and each step I took to solve it. With the example I made on the side just continue to repeat that for each one to get the answers. You just replace that one number for the X to take the place for the next X value as you go down the table solving them.
$16.67 would be the price of each pencil. You divide 50 by 3 and get 16.6 repeating so you round it up to 16.67
Answer:


Step-by-step explanation:
<u><em>Explanation:-</em></u>
Non -terminating decimals are the one that does have an end term. it has infinite number of terms
Example :-


Answer:
aku orang baik , tolong baukanabsusjwggdeaysersusurs