FI-MO 1998 Problem 2
There are members in the competetion committee. The problem set is kept in a safe having several locks. The committee members have been provided with keys in such a way that every six members can open the safe, but no fi ve members can do that. What is the smallest possible number of locks, and how many keys are needed in that case?
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.