Consider infinite people with each wearing a red or a black hat such that they can't see their hat but can see other's hat. Now, everybody has to tell the color of his hat simultaneously.

a) Derive a strategy such that infinite people can say correct answer

b) Derive a strategy that only finite people will say wrong answer

a) Derive a strategy such that infinite people can say correct answer

b) Derive a strategy that only finite people will say wrong answer

for a) pair up everyone.. first answers assuming that both have same colored hat and second answers assuming both have different colored hat.

ReplyDeleteb) too difficult uses axiom of choice to solve.

a) after pairing first answers the same color as the 2nd one wears

ReplyDeleteand the 2nd one answers the opposite color as the 1st one wear.

b) I don't know, I want someone to solve

This comment has been removed by the author.

ReplyDeleteinfinite case solution

ReplyDeletehttp://en.wikipedia.org/wiki/Prisoners_and_hats_puzzle