Problem

Source:

Tags: combinatorics



In a group of $2021$ people, $1400$ of them are $\emph{saboteurs}$. Sherlock wants to find one saboteur. There are some missions that each needs exactly $3$ people to be done. A mission fails if at least one of the three participants in that mission is a saboteur! In each round, Sherlock chooses $3$ people, sends them to a mission and sees whether it fails or not. What is the minimum number of rounds he needs to accomplish his goal?