An unknown number n of logicians will play the following game:
A moderator will stick two stamps on each logicians' forehead. He tells everyone that he has n+1 red stamps and n+1 black stamps. They do not know, however, that the moderator has already stuck one red and one black stamp on the forehead of each logician, except for one to whom he has stuck two red stamps.
The logicians are sitting on a circle so that anyone can see everyone else's stamps. The moderator asks them in turn, starting from the logician who is sitting in the position Nr 1, "what color are your stamps?" The logician with the two red stamps on his forehead is sitting in the position Nr x (unknown to us).
For which values of n and x the logician with the two red stamps can guess the color of his own stamps?
Last edited by anna_gg (2013-03-30 07:37:10)
A few questions:
Do they know which stamps the others have on their foreheads and do they know what color of stamps were the ones the moderator still has?
Here lies the reader who will never open this book. He is forever dead.
Taking a new step, uttering a new word, is what people fear most. ― Fyodor Dostoyevsky, Crime and Punishment