Since we are trying to find the number of sequences can be made <em>without repetition</em>, we are going to use a combination.
The formula for combinations is:
is the total number of elements in the set
is the number of those elements you are desiring
Since there are 10 total digits, 
in this scenario. Since we are choosing 6 digits of the 10 for our sequence, 
in this scenario. Thus, we are trying to find 
. This can be found as shown:
There are 210 total combinations.
10t+50=100
-50 -50
10t=50
10t/10=50/10
t=5
Answer:
The answer is D
Step-by-step explanation:
Since the input is -6, you input it into the equation. That would make it f(-6)=-(-6)-1 which would be equivalent to f(-6)=6-1 , as the negatives at the beginning of the equation cancel each other out and make it positive. Then you solve and get 5, which is your output. Hope I could help :)
Answer:
120, 15
Step-by-step explanation:
Answer: domain: x>-3
range: y > -1
Step-by-step explanation:
