In a room of 100 leaders, at least 1 leader is honest; and in every pair, at least one leader is dishonest. Find the maximum number of honest leaders, if every leader is either honest or dishonest.

  • $\begingroup$ Welcome to Puzzling! Please do not use random tags - make sure the tags you use are applicable to the question. $\endgroup$
    – Deusovi
    Aug 16, 2016 at 21:31

1 Answer 1


I feel like the question could be a little more clear, but if I'm understanding it right the answer is:

Just that one. If there were more, you would create a possible pair of two leaders such that not every pair contains at least one dishonest leader.


Not the answer you're looking for? Browse other questions tagged or ask your own question.