AMC 10 Daily Practice Round 1
Complete problem set with solutions and individual problem pages
Problem 8 Easy
There are keys and locks, but you don't know which key opens which lock. Each key opens exactly one lock. What is the maximum number of attempts needed to match all the keys to their corresponding locks?
- A.
- B.
- C.
- D.
- E.
Answer:B
In the worst-case scenario, you would try the first key with 3 locks before finding the correct one, then set that key and lock aside. For the remaining 3 keys and locks, you would try the second key with 2 locks before finding the correct match, then set them aside as well. For the remaining 2 keys and locks, you would only need to try 1 lock before matching the key. The last key and lock do not require testing since they are the only pair left. Therefore, the maximum number of attempts needed is 3+2+1 = 6 attempts. Thus, the answer is .
