Problem #PRU-88031

Problems Methods Algebraic methods Processes and operations Set theory and logic Theory of algotithms Theory of algorithms (other)

Problem

There are 6 locked suitcases and 6 keys for them. It is not known which keys are for which suitcase. What is the smallest number of attempts do you need in order to open all the suitcases? How many attempts would you need if there are 10 suitcases and keys instead of 6?