Answer:
<h2> 32</h2>Step-by-step explanation:
Fill in the blank with the correct word to describe this expression: n + 4 , the blank of a number and four)
1 answer:
You might be interested in
Answer:
x = - , x = 2
Step-by-step explanation:
To find h(g(x)) substitute x = g(x) into h(x) , that is
h(g(x))
= h(x + 1)
= (x + 1)²
= x² + 2x + 1
For h(g(x)) = 3x² + x - 5 , then
3x² + x - 5 = x² + 2x + 1 ← subtract x² + 2x + 1 from both sides
2x² - x - 6 = 0 ← in standard form
(2x + 3)(x - 2) = 0 ← in factored form
Equate each factor to zero and solve for x
2x + 3 = 0 ⇒ 2x = - 3 ⇒ x = -
x - 2 = 0 ⇒ x = 2
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.
