RU-SPB 2008 Problem 104
A wizard thinks of a number from to . You can ask the wizard any number of yes/no questions about the number. The wizard must answer all those questions, but not necessarily in the respective order. What is the least number of questions that must be asked in order to know what the number is for sure. (In terms of .)
Fresh translation.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.