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.
There is no image but I would likely be glad to help! :)
Answer:
Use the appropriate entry method for piecewise functions for the graphing calculator of interest.
Step-by-step explanation:
For Desmos, the entry looks like ...
f(x) = {x ≤ 2: -2x-1,-x+4}
_____
For a TI-84 calculator, the entry may look like ...
Y₁ = (-2X–1)(X≤2) + (-X+4)(X>2)
The symbols ≤ and > come from the TEST menu, which is the (2nd) shift of the MATH key.
Note that the function is the sum of the pieces, each piece multiplied by a test. For something like 0≤x<2, the multiplier would be a pair of tests:
... (0≤X)(X<2)
<h2>
Answer with explanation:</h2>
The number of letters in word "ALGORITHM" = 9
The number of combinations to select r things from n things is given by :-
Now, the number of combinations to select 6 letters from 9 letters will be :-
Thus , the number of ways can six of the letters of the word ALGORITHM=84
The number of ways to arrange n things in a row :
So, the number of ways can the letters of the word ALGORITHM be arranged in a be seated together in the row :-
If GOR comes together, then we consider it as one letter, then the total number of letters will be = 1+6=7
Number of ways to arrange 9 letters if "GOR" comes together :-
Thus, the number of ways to arrange 9 letters if "GOR" comes together=5040