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:
<em>19</em>
Step-by-step explanation:
has a factor
and
when divided by
, remainder is 20.
To find:Remainder when divided by (x-1) ?
Solution:
is a factor
when we put this value of x to the function, it will become 0.
i.e.

Remainder is 20 when f(x) is divided by 
i.e.


Solving (1) and (2), Multiply equation (1) by 2 and adding to (2):

By equation (1):

So, the equation becomes:


So, when divided by (x-1), remainder will be <em>19</em>.
Answer:
x = 4
Step-by-step explanation:
3x÷2=6
Multiply both sides by 2.
3x = 12
Divide by 3.
x = 4
Answer:
1.40
Step-by-step explanation:
I feel if you divide $14.00 by 10 you would get 1.40, so I say this should be the right answer.
I apologize if I am incorrect.