Problem #PRU-35474

Problems Discrete Mathematics Algorithm Theory Theory of algorithms (other)

Problem

A journalist came to a company which had \(N\) people. He knows that this company has a person \(Z\), who knows all the other members of the company, but nobody knows him. A journalist can address each member of the company with the question: “Do you know such and such?” Find the smallest number of questions sufficient to surely find \(Z\). (Everyone answers the questions truthfully. One person can be asked more than one question.)