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:
x = √39
General Formulas and Concepts:
<u>Pre-Algebra</u>
Order of Operations: BPEMDAS
- Brackets
- Parenthesis
- Exponents
- Multiplication
- Division
- Addition
- Subtraction
Equality Properties
<u>Trigonometry</u>
- [Right Triangles Only] Pythagorean Theorem: a² + b² = c²
Step-by-step explanation:
<u>Step 1: Identify</u>
Leg <em>a</em> = <em>x</em>
Leg <em>b</em> = 5
Hypotenuse <em>c</em> = 8
<u>Step 2: Solve for </u><em><u>x</u></em>
- Substitute [PT]: x² + 5² = 8²
- Isolate <em>x</em> term: x² = 8² - 5²
- Exponents: x² = 64 - 25
- Subtract: x² = 39
- Isolate <em>x</em>: x = √39
Answer:
![f^{-1}(x)=\sqrt[3]{x}-6](https://tex.z-dn.net/?f=f%5E%7B-1%7D%28x%29%3D%5Csqrt%5B3%5D%7Bx%7D-6)
Step-by-step explanation:
![\sqrt[3]{x}=y+6](https://tex.z-dn.net/?f=%5Csqrt%5B3%5D%7Bx%7D%3Dy%2B6)
![\sqrt[3]{x}-6=y](https://tex.z-dn.net/?f=%5Csqrt%5B3%5D%7Bx%7D-6%3Dy)
Answer:
14
Step-by-step explanation:
There are 3 even and 3 odd sides meaning its a 50/50 chance for either to happen each time you roll. This means half of the results are expected to be odd and even.
