Problem #PRU-116490

Problems Discrete Mathematics Algorithm Theory Theory of algorithms (other)

Problem

There are 100 boxes numbered from 1 to 100. In one box there is a prize and the presenter knows where the prize is. The spectator can send the presented a pack of notes with questions that require a “yes” or “no” answer. The presenter mixes the notes in a bag and, without reading out the questions aloud, honestly answers all of them. What is the smallest number of notes you need to send to know for sure where the prize is?