Tessellate S.T.E.M.S. (2019) - Computer Science - School - Set 4 - Objective Problem 4

Rama and Sita play some game which goes as follows. Sita first think about a natural number between 1 1 and 100 100 . 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)

1 7 4 10

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.

1 solution

Jordan Cahn
Dec 26, 2018

With every question, Rama can eliminate half of the possible numbers. Thus, in the worst case, it will take 2 n 2^n questions to narrow down the 100 100 possibilities, where n n is our solution. log 2 100 = 7 \lceil\log_2 100 \rceil = \boxed{7}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...