Number the coins from 000000 to 111111 (in binary), and let F be the freedom coin. The prisoner then flips coin (F XOR G), where G is the XOR of all of the heads-up coins. Then the next prisoner just XORs all of the heads-up coins to obtain F. Sincerely, Adam P. Goucher
Sent: Thursday, April 16, 2015 at 2:03 AM From: "Veit Elser" <ve10@cornell.edu> To: math-fun <math-fun@mailman.xmission.com> Subject: Re: [math-fun] Mensa Correctional Facility
There is a solution when the inmate is required to flip a coin, so let’s stick with that more restrictive variant.
-Veit
On Apr 15, 2015, at 5:47 PM, Cris Moore <moore@santafe.edu> wrote:
Is the inmate allowed to _not_ flip any coin?
Cris
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun