Which recursive formula can be used to generate the sequence
below, where f(1) = 3 and n ≥ 1?
3, –6, 12, –24, 48
The recursive formula for this sequence is
f (n + 1) = –2 f(n)
at n=1 f(n)= 3
at n = 2
f(2) = -2 (3) = -6
n = 3
f(3) = -2 (-6) = 12 and so on
Answer:
It was the The Large Cardinal Project.
Step-by-step explanation:
They used this form of math to calculate the precise place the bomb would land, which was the town where the dictator lived
Answer:
$54
Step-by-step explanation:
50 * $1.20 = $60
Before the discount, 50 jars cost $60.
Since the discount rate is 10%, he will pay only 90% of the price since 100% - 10% = 90%.
90% of $60 =
= 90% * $60
= 0.9 * $60
= $54
You can do 5+5+10, 6+6+8, 9+9+2, 4+4+12, 3+3+14, 2+2+16, 1+1+18. I believe these are all of them, so there are 7 ways.
Answer:
3601
-589
———-
To
359(11)
-589
———-
3012
Step-by-step explanation:
