Comby for robbers
Eleven robbers own a treasure box. What is the least number of locks they can put on the box so that there is a way to distribute the keys of the locks to the eleven robbers with no five of them can open all the locks, but every six of them can open all the locks?The robbers agree to make enough duplicate keys of the locks for this plan to work.
$\color{blue}{\textit{To}} \color{red}{\textit{ problems }} \color{blue}{\textit{I am encountering with-}} \color{green}{\textit{AVADA KEDAVRA!}}$
Re: Comby for robbers
My solution (after a tedious observation):
$\color{blue}{\textit{To}} \color{red}{\textit{ problems }} \color{blue}{\textit{I am encountering with-}} \color{green}{\textit{AVADA KEDAVRA!}}$
Re: Comby for robbers
Sanzeed, claps for the observation.
Let me add something to the problem- What is the least number of keys that each robber must carry ?
Let me add something to the problem- What is the least number of keys that each robber must carry ?
Re: Comby for robbers
Hey, where's Sanzeed ? Please post the solution of the problem.