Answer:
34,220
Step-by-step explanation:
Because order doesn't matter, but the numbers can't be repeated, we need to find the number of combinations where 3 individual numbers can be chosen out of 60 possible numbers using the binomial coefficient:
Thus, Elias can make 34,220 unique 3-number codes given 60 different numbers.
Answer:
2 7/20
Step-by-step explanation:
here u go boo
Answer:
B
Step-by-step explanation:
A function has at most one y value for every x value. This means that for every vertical line, there can be at most one intersection.
This example clearly doesn't satisfy this requirement.
Answer:
its 61.4x+15
Step-by-step explanation:
Pic 1 is correct
Pic 2 is correct
Pic 3 is correct
