F(1) =-3 f(1)=−3 f(n)=2⋅f(n−1)+1 f(2)=
2 answers:
Answer:
3
Step-by-step explanation:
f(1)=−3
f(n)=2⋅f(n−1)+1
f(2)= 2×1(2-1)+1
= 2×1+1
= 2+1
= 3
Answer:
-5
Step-by-step explanation:
You might be interested in
Answer:
448
Step-by-step explanation:
4*2*7*8=448 different combinations
1.= 1
2.= -15
3.= -18
4.= -1
5. = -11
6. = 22
The estimated cost is 400$
If you use the distance formula you get 10.
The answer would be 5 like they said
