Timeline for An infinite hat puzzle variation—if we don't know our place, can we still be almost all correct?
Current License: CC BY-SA 4.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 31 at 17:19 | history | edited | bof | CC BY-SA 4.0 |
added 45 characters in body
|
Jul 31 at 17:18 | comment | added | bof | @JoelDavidHamkins Oops, thanks for the correction. Hope I've got it right now. | |
Jul 31 at 14:52 | comment | added | Joel David Hamkins | Thanks for this answer. I think you haven't quite defined $f$ correctly, however, since one must allow that perhaps the chosen representative places more than one extra item in front of the observed sequence, so you should say $f(x)=x_0$, if some member of $C$ has $(x_0,x_1,x_2,x_3,\ldots)$ as a final segment. | |
Jul 31 at 10:35 | comment | added | Timothy Chow | Problem 5348 was indeed posed by Fred Galvin, who had a solution, although the published solution is attributed to D. L. Silverman. But then in this addendum, it says that Silverman withdrew his solution, and a solution by B. L. D. Thorpe is offered instead. | |
Jul 31 at 4:31 | history | answered | bof | CC BY-SA 4.0 |