Answer:
g(x) = 5 – x
Step-by-step explanation:
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.
9514 1404 393
Answer:
about 9.80 cm
Step-by-step explanation:
The length of half the segment (h) can be found from the Pythagorean theorem:
h² +5² = 7²
h² = 7² -5² = 49 -25 = 24
h = √24 = 2√6
This is half the segment length, so the whole segment length is ...
L = 2h = 2(2√6)
L = 4√6 ≈ 9.7980
The length of the segment is 4√6 ≈ 9.80 cm.
Answer:
72
Step-by-step explanation:
it would be 72 because your adding 56+16 and that equals 72 numbers he will use
