# Problem 41 ***

A (countably) infinite class of Cambridge students who believe in the Axiom of Choice are taking their finals for the Mathematical Tripos. At the start of the exam, the examiner places either a white or a black hat on each student at random. There is only one question in the exam: “What colour is your hat?” If only a finite number of students answers incorrectly then everyone becomes a Wrangler (very good), otherwise the Wooden Spoon is given to the whole class (very bad). Everyone can see the hats of everyone else besides their own, and since it’s exam conditions they are not allowed to communicate. Students may not remove their hats or try to look at it in any way.

What strategy could the students devise together so to avoid failure and the impending doom of unemployment? Being clever clogs from Cambridge, memorising infinitely large amounts of data is no problem to the students.

Note: A student suggested that each person just guess at random. However this has already been ruled out by the cleverer students who realised that if they were really unlucky, infinite of them could guess wrong.

[originally posted by ukdragon37]