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.
Hi there, 1+1=2 and 4/7+4/7=8/7. Therefore, Mary and Fred ate 2 8/7 of the pie.
You do 90-45 bc the whole angel must equal 90
Answer:
7 . 4 + 6 - 12 : 4 = 31
Step-by-step explanation:
* To solve this problem lets revise the order of operations in
mathematics
- The operations are:
# Addition
# Subtraction
# Multiplication
# Division
# Exponentiation
# Grouping ⇒ Parenthesis or brackets
- The order of these operations is:
# Parenthesis
# Exponents
# Multiplication and Division which comes first from left to right
# Addition and Subtraction which comes first from left to right
- There is a word made from the first letter of each operation
PEMDAS to remember the order of operations
* Lets solve the problem
∵ 7 . 4 + 6 - 12 : 4
∵ The (.) means multiply the numbers
∵ The symbol (:) means divided the numbers
∴ At first multiply 7 by 4 and divide 12 by 4
∴ (7 × 4) + 6 - (12 ÷ 4)
∴ 28 + 6 - 3
∵ Addition comes before subtraction from the left
∴ (28 + 6) - 3
∴ 34 - 3 = 31
∴ 7 . 4 + 6 - 12 : 4 = 31
Where is the graph? Upload a picture of the graph first
