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.
0.12 can be written as 12/100 or 3/25. It is very much a rational number as no square root is involved in the fractional form of the number.
Answer:
The answer would be "j"
Step-by-step explanation:
First, you would want to find the value of the original equation:
5(y + 2) + 4
Use order of operations and distribute the five.
5y + 10 + 4
5y +14
This is the value of the original equation
Now we can work through the other options, but because we already know the answer, lets see about that one.
5 x y + 5 x 2 + 4
Again, use order of operations.
Multiply first
5y + 10 + 4
and complete the equation
5y + 14, which equals our original equation.
The answer to your question is B.Opposite sides are parallel.
Linear because x moves up by 3 and y moves up by 7
