Rama and Sita play some game which goes as follows. Sita first think about a natural number between and . Rama asks questions to Sita, but Sita can only reply in ”yes” or ”no” . Sita is a honest lady, and never tells a lie. What is the least number of questions Rama needs to ask such that he always figure out the number, Sita thought about?
This problem is a part of Tessellate S.T.E.M.S (2019)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
With every question, Rama can eliminate half of the possible numbers. Thus, in the worst case, it will take 2 n questions to narrow down the 1 0 0 possibilities, where n is our solution. ⌈ lo g 2 1 0 0 ⌉ = 7