現代数学の系譜11 ガロア理論を読む22

現代数学の系譜11 ガロア理論を読む22at MATH

現代数学の系譜11 ガロア理論を読む22 - 暇つぶし2ch128: each prisoner what the color of his own hat is (ie, he first asks the person who can see all other prisoners). Any prisoner who is correct may go free. Every prisoner can hear everyone else’s guesses and whether or not they were right. If all the prisoners can agree on a strategy beforehand, what is the best strategy? The answer to this in a moment; but first, the relevant generalization. A countable infinite number of prisoners are placed on the natural numbers, facing in the positive direction (ie, everyone can see an infinite number of prisoners). Hats will be placed and each prisoner will be asked what his hat color is. However, to complicate things, prisoners cannot hear previous guesses or whether they were correct. In this new situation, what is the best strategy? Intuitively, strategy is impossible since no information can be conveyed from anyone who knows your hat color to you, so it would seem that everyone guessing blindly. However, all but a finite number of prisoners can go free! つづく

次ページ

続きを表示

1を表示