Answer:
5040 different combinations
Step-by-step explanation:
0-9 = 10 numbers
1st digit can be 1 0f 10
2nd digit can be 1 of 9
3rd digit can be 1 of 8
4th digit can be 1 of 7
10×9×8×7=5040
Answer:
f(n) = -n^2 -3n +5
Step-by-step explanation:
Suppose the formula is ...
f(n) = an^2 +bn +c
Then we have ...
f(1) = 1 = a(1^2) +b(1) +c
f(2) = -5 = a(2^2) +b(2) +c
f(3) = -13 = a(3^2) +b(3) +c
__
Here's a way to solve these equations.
Subtract the first equation from the second:
-6 = 3a +b . . . . . 4th equation
Subtract the second equation from the third:
-8 = 5a +b . . . . . 5th equation
Subtract the fourth equation from the fifth:
-2 = 2a
a = -1
Then substituting into the 4th equation to find b, we have ...
-6 = 3(-1) +b
-3 = b
and ...
1 = -1 +(-3) +c . . . . . substituting "a" and "b" into the first equation
5 = c
The formula is ...
f(n) = -n^2 -3n +5
2008 - 1626 -= 382
24 x (1.305)^382
= 12,229,955,10
Hope this helps