so, let's first change the bounds from 1 to 9, so we'll be dropping the indices by 1, in order to do the variable "n".
however, let's use a variable hmmm say "k", where "k" is the value of "n" beginning at 1, thus
k = n - 1.
however, if k = n - 1, then
k + 1 = n. So let's use those fellows then,
Step-by-step explanation:
14x+10+2x
16x+10. Answer 1
5x+3x+10+8x
16x+10. Answer 2
So, both Answers are same, So the expressions are equivalent...
Answer:
The biggest number he can make is 348. Hope this helps!!!
Step-by-step explanation:
You have to multiply 4 and 7 together to get 28. Since if we multiplied every number together, we would end up with a lesser number, since anything multiplied by 1 is itself. Therefore, you next add 1 to 28 to get 29. Finally multiply 29 by 12 to get 348.
Answer:
f(5) = 3200
Step-by-step explanation:
Using the recursive formula to generate the terms, that is
f(2) = 2 × f(1) = 2 × 200 = 400
f(3) = 2 × f(2) = 2 × 400 = 800
f(4) = 2 × f(3) = 2 × 800 = 1600
f(5) = 2 × f(4) = 2 × 1600 = 3200
The correct answers would be a b and 2 because I don’t know this is a test to be honestly
