Skip to main content

Stamps



B says: "Suppose I have red-red. A would have said on her second turn: 'I see that B has red-red. If I also have red-red, then all four reds would be used, and C would have realized that she had green-green. But C didn't, so I don't have red-red. Suppose I have green-green. In that case, C would have realized that if she had red-red, I would have seen four reds and I would have answered that I had green-green on my first turn. On the other hand, if she also has green-green [we assume that A can see C; this line is only for completeness], then B would have seen four greens and she would have answered that she had two reds. So C would have realized that, if I have green-green and B has red-red, and if neither of us answered on our first turn, then she must have green-red.
"'But she didn't. So I can't have green-green either, and if I can't have green-green or red-red, then I must have green-red.'
So B continues:
"But she (A) didn't say that she had green-red, so the supposition that I have red-red must be wrong. And as my logic applies to green-green as well, then I must have green-red."
So B had green-red, and we don't know the distribution of the others certainly.
(Actually, it is possible to take the last step first, and deduce that the person who answered YES must have a solution which would work if the greens and reds were switched -- red-green.) 

Comments

Popular posts from this blog

Greedy Pirates

If there are two pirates left (#4 & #5), #4 has no options. No matter what he proposes, pirate #5 will disagree, resulting in a 1-1 vote (no majority). #5 will kill #4 and will keep all of the gold. Now say there are 3 pirates left. #4 has to agree with whatever #3 decides, because if he doesn't #3 will be killed (because #5 won't vote for #3's proposal no matter what it is). #3 will just propose that he keep all of the gold and will get a 2-1 vote in his favor. Now if there are 4 pirates left: #3 won't vote for #2's proposal because if #2's fails, #3 will get all of the gold. #4 and #5 know that they will get nothing if the decision goes to #3, so they will vote for #2's proposal if he gives them one gold piece each. Therefore, #2 would keep 998 gold, and #4 and #5 would each get one gold. So let's wrap this up: Pirate #1 needs 2 other votes. He will not get a vote from #2 because #2 will get 998 gold if #1's plan fails. #1 offers #3 o...

Murder!!!

   Ans : 16 Name the 10 people with letters: A, B, C, ... and so on. A through F each call any one of G, H, I, or J (it doesn't matter which one). That makes six calls so far. Then G calls H and I calls J, after which G calls I and H calls J. Now we've used 10 calls, and G, H, I, and J all know everything. Finally, each of A through F is called by someone in G through J - 6 more calls to get everyone knowing everything. 16 calls in all.

What is the 10 Digit Number?

  6210001000 There are 6 zeros, 2 ones, 1 two, 0 threes, 0 fours, 0 fives, 1 six, 0 sevens, 0 eights, and 0 nines.