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.
Answer:
3x^2+6x+4 is the answer :D
Volume= Length * width ( aka Base ) * height
Break up the figure into easier figures, a small square and a bigger square.
Small square- 3*2*1 = 6 cm
Large Square- 7*6*1 = 42 cm
42 + 6 = 48 cm. But wait! You have to take one more step, which is minus-ing 6 from 48. Why? Notice that there is a little area where a side of the small square meets the bigger square. That little area is worth 3 cm ( length is 3, height is 1 cm ) times 2 ( 3 cm is one side, another 3 cm is the other side from the other square ) = 6 cm.
Your total answer should be 42. ( or 48, if your teacher doesn't count the area where the squares meet/join together ).
Step-by-step explanation:
A number,c times two equal forty.
