Answer:
720 balls
Step-by-step explanation:
Can = 3 balls
Box = 4 cans = 4*3balls = 12 balls
Case = 6 boxes = 6* 12balls = 72 balls
10 cases = 10 *72balls = 720 balls
A formula is recursive if it expresses the term
in terms of the previous one(s) ![a_{n-1},\ a_{n-2},\ \ldots,\ a_1](https://tex.z-dn.net/?f=%20a_%7Bn-1%7D%2C%5C%20a_%7Bn-2%7D%2C%5C%20%5Cldots%2C%5C%20a_1%20)
In this case, every term is 7 more than the previous one, so the formula for
will only involve
:
![a_n = a_{n-1} + 7](https://tex.z-dn.net/?f=%20a_n%20%3D%20a_%7Bn-1%7D%20%2B%207%20)
In fact, this formula is simply saying: for every index
, the term with that index is 7 more than the term before.
Also, we have to specify the starting point (otherwise we would go backwards indefinitely), so the complete recursive formula is
![a_n = a_{n-1} + 7,\quad a_1 = 2](https://tex.z-dn.net/?f=%20a_n%20%3D%20a_%7Bn-1%7D%20%2B%207%2C%5Cquad%20a_1%20%3D%202%20)
which means: start with 2 and generate every other term by adding 7 to the previous one.
When x = 0 the value of the function is 2 so its either A or B.
When x = 1, y = 8 so substituting these values in A we get:-
8 = 2 * 8^1 = 16 so
its Not A. Try B:-
8 = 2 *4^1 = 8 which fits
Answer is choice B
Answer: -2, 0 and 0, 2 and 2, 4
Step-by-step explanation:
D. f(x)= x*-9x^o+2x^2-4x+10