Problem #PRU-35592

Problems Set theory and logic Theory of algotithms Theory of algorithms (other)

Problem

Your task is to find out a five-digit phone number, asking questions that can be answered with either “yes” or “no.” What is the smallest number of questions for which this can be guaranteed (provided that the questions are answered correctly)?