Answer:
(-2,1) (-1,1),(0,1)
Step-by-step explanation:
find the gradient first
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:
If A is wrong then B I think
Step-by-step explanation:
An equilateral polygon has congruent sides, like a rhombus.
An equiangular polygon has congruent interior angles, like a rectangle.
In other words: Equilateral doesn't necessarily have congruent INTERIOR angles while equiangular does have/need congruent interior angles.
Answer:
C
Step-by-step explanation:
y=1/x, the reciprocal is the same. Reciprocal would be reflected across y=x
