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:
d) one solution; (4, 1)
Step-by-step explanation:
It often works well to follow problem directions. A graph is attached, showing the one solution to be (4, 1).
_____
You know there will be one solution because the lines have different slopes. Each is in the form ...
y = mx + b
where m is the slope and b is the y-intercept.
The first line has slope -1 and y-intercept +5; the second line has slope 1 and y-intercept -3. The slope is the number of units of "rise" for each unit of "run", so it can be convenient to graph these by starting at the y-intercept and plotting points with those rise and run from the point you know.
Answer:
Linear
Step-by-step explanation:
It is just a never ending straight line. no complications in that.
For this case, the first thing we must do is define variables:
x: unknown number (1)
y: unknown number (2)
We now write the equations that model the problem:
their sum is 6.1:
their difference is 1.6:
Solving the system we have:
We add both equations:
Then, we look for the value of y using any of the equations:
Answer:
The numbers are:
60 because 2:4 is 1/2, and when you divide by a fraction, you multiply by the reciprocal (2/1 instead of 1/2) which would be 60 in this case.
