Answer:
helpme
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.
5x - 15y = -8
15y = 5x - 8
Answer: 15y = 5x - 8
In any rhombus, the four sides are the same length.
Because of this, we know that
Furthermore, AC = AC due to the reflective property
Those three facts then allow us to prove triangle ACD is congruent to triangle ACB through the SSS congruence property. Then from CPCTC, we then know that angle DAC = angle BAC, which is enough to show that AC bisects the angle shown. The term "bisect" means "cut in half".
Answer:
The last choice availablle
Step-by-step explanation:
The way you can tell the points the function has in common with the x-axis (also known as the solutions, roots, or zeros of the functiion) you have to factor it to solve for x. When you throw this into the quadratic formula you get that there is a negative under the square root sign, which is indicative of imaginary solutions. Imaginary solutions do NOT cross the x-axis. So the answer to your problem is the last choice.