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.
Jacob has the faster time because if you make the fractions equal you would make the denominators equal by rounding 3/4 to have a denominator of 12 making it 9/12 which is larger then 5/12 making Daniel's time slower then Jacob's.
Answer:
all done bud, I'm just here for the extra points :D
Answer:
-I haven't done this, but I have copied and pasted from another question and answer from the user syed514:
Graphing is one way to do the problem.But sometimes, graphing it is hard to do.So here’s an algebraic method.
If M(m1, m2) is the midpoint of two points A(x1, y1) and B(x2, y2),then m1 = (x1 + x2)/2 and m2 = (y1 + y2)/2.In other words, the x-coordinate of the midpointis the average of the x-coordinates of the two points,and the y-coordinate of the midpointis the average of the y-coordinates of the two points.
Let B have coordinates (x2, y2) in our problem.Then we have that 6 = (2 + x2)/2 and 8 = (3 + y2)/2.
Solving for the coordinates gives x2 = 10, y2 = 13