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:
really good
Step-by-step explanation:
<h2>thanks for your help you<u> with</u><u> that</u><u> do</u><u> not</u><u> have</u><u> a</u><u> copy</u><u> of</u><u> the</u><u> receipt</u><u> for</u><u> your</u><u> time</u><u> to</u><u> help</u><u> you</u><u> with</u><u> the</u></h2>
Answer:
Step-by-step explanation:
the triangle with 9 as a side is a 45,45, 90 triangle. so there for x and 9 are congruent. Thus. x=9
Answer:
F is reduced by 31%
Step-by-step explanation:
F = 1/(d²)
now, we increase the distance by 20% (multiply by 1.2).
F new = 1/(1.2×d)² = 1/(1.44×d²) = (1/1.44) × (1/(d²)) =
= 1/1.44 × old F = 0.69 × old F
100 - 69 = 31%
Answer:
Isolate the variable by dividing each side by factors that don't contain the variable.
x = w/3 - 2/3