Problem #PRU-103009

Problems Discrete Mathematics Algorithm Theory Theory of algorithms (other)

Problem

There are 6 locked suitcases and 6 keys to them. At the same time, it is not known to which suitcase each key fits. What is the smallest number of attempts you need to make in order to open all the suitcases for sure? And how many attempts will it take there are not 6 but 10 keys and suitcases?