Answer:
- 3, - 11, - 35, - 107
Step-by-step explanation:
Using the recursive formula with f(1) = - 3 , then
f(2) = - 2 + 3f(1) = - 2 + 3(- 3) = - 2 - 9 = - 11
f(3) = - 2 + 3f(2) = - 2 + 3(- 11) = - 2 - 33 = - 35
f(4) = - 2 + 3f(3) = - 2 + 3(- 35) = - 2 - 105 = - 107
Thus the first four terms are
- 3, - 11, - 35, - 107
Answer: 0.9
Step-by-step explanation:
Answer:
165°
Step-by-step explanation:
Answer:
1716 ways
Step-by-step explanation:
Given that :
Number of entrants = 13
The number of ways of attaining first, second and third position :
The number of ways of attaining first ; only 1 person can be first ;
Using permutation :
nPr = n! ÷(n-r)!
13P1 = 13! ÷ 12! = 13
Second position :
We have 12 entrants left :
nPr = n! ÷(n-r)!
12P1 = 12! ÷ 11! = 12
Third position :
We have 11 entrants left :
nPr = n! ÷(n-r)!
11P1 = 11! ÷ 10! = 11
Hence, Number of ways = (13 * 12 * 11) = 1716 ways
Answer:
It like the once like Line with smaller angle (DBC) measure wouldn't 30* and by the exam the ratio of angle use by subjective by multiplying as large of angle.
oh, by the way I think I hope I'm right so good luck with that?
