Solution of Ulam's problem on binary search with three lies

AbstractIn this paper we determine the minimal number of yes-no queries needed to find an unknown integer between 1 and 1000000 if at most three of the answers may be erroneous