QUESTION:
The code for a lock consists of 5 digits (0-9). The last number cannot be 0 or 1. How many different codes are possible.
ANSWER:
Since in this particular scenario, the order of the numbers matter, we can use the Permutation Formula:–
- P(n,r) = n!/(n−r)! where n is the number of numbers in the set and r is the subset.
Since there are 10 digits to choose from, we can assume that n = 10.
Similarly, since there are 5 numbers that need to be chosen out of the ten, we can assume that r = 5.
Now, plug these values into the formula and solve:
= 10!(10−5)!
= 10!5!
= 10⋅9⋅8⋅7⋅6
= 30240.
G(x)=− 4 x 2 +7g, left parenthesis, x, right parenthesis, equals, minus, start fraction, x, start superscript, 2, end superscr
steposvetlana [31]
For this case, what we should do is evaluate the function for different points within the range shown.
We then have the following table:
x g(x)
-2 -9
-1 3
0 7
1 3
2 -9
3 -29
4 -57
From where we observed that the average rate of change is:
-13
Answer:
the average rate of change of g over the interval [-2,4] is:
-13
Answer:
a. 20h + 8
Step-by-step explanation:
-2(-7h-4) + 6h = 14h + 8 + 6h = 20h + 8
Step-by-step explanation:
The answer is in the pic above
Cat hikibccvbmikjkvbbnm Cohn
