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:
8/32=0.25
Step-by-step explanation:
Answer:
10 + 5xy = -80
Step-by-step explanation:
10 + 5xy = ?
x = 9 and y = -2
10 + 5xy = 10 + 5(9)(-2)
= 10 - 90
= -80
X+(x+1)=17
So 2x+1=17
Which means 2x=16
Which then means x=8
But you still need the second number, which is x+1, so 8+1=9.
This means that the consecutive numbers are 8 and 9.
Answer:
a) will definitely be an odd number
Step-by-step explanation:
4^n is always even (when you multiply even and even number, the product is always even)
when you add one to even number, the sum is always odd
so 4^n +1 is odd.