Teaser Tuesday! March 18, 2014
Time to get those brains warmed up!
Note: If you could all please input your answers using the previously noted html code it will allow others to answer without having a spoiler. Also, in your answer, do not include any ' or " or it will not work properly.
Question
I am thinking of an integer n with 0 LIE about at most one of the answers. What seven questions can you ask to determine n?
Good luck!
I don't think this works because he says the answers have to be "independent" of each other. Therefore, you essentially submit all the questions at once and then he answers all 7 yes or no.
The other problem is that he could tell the truth both the first and second time you ask if it is odd, and then lie later on about one of the subsets, but you won't know which one. This is a tough one...
It's done through binary. I'm not in the mood to stimulate my mind this much though as my mind is ready to shut off in about 29 minutes.
The way that I took it as independent given the information provided I couldn't ask, if the number is bigger than or equal to 7, is the number bigger than or equal to 9? But I could ask is the number bigger than or equal to 7. I could also ask is the number bigger than or equal to 9.
But reading it over again, I guess that method wouldn't work.
But if he lied about when I asked if the number was greater than or equal to a certain number I would figure it out in the subsequent questions and still be able to solve the question.
Using binary I think I can figure out the number in only 5 questions:
Will M: If they answer "Yes" to your first question, then that isn't a lie. You therefore cannot solve if any of the other answers are lies.
Nulla numquam iste deserunt rerum. Aut nam et ducimus deleniti ut dolorem odit consectetur.
See All Comments - 100% Free
WSO depends on everyone being able to pitch in when they know something. Unlock with your email and get bonus: 6 financial modeling lessons free ($199 value)
or Unlock with your social account...