Minimum: 1
Q1: 2.5
Q2: 5
Q3: 7
Maximum: 13
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.
He could have 30 dimes and 13 quartars
(-4,6)
The x value changes bc since it is a reflection y cannot change and x becomes negative
48cm2 is the answer because