28 Oct
2016
28 Oct
'16
8:29 a.m.
So far, no one has submitted a correct solution. —Dan
On Oct 28, 2016, at 7:18 AM, James Propp <jamespropp@gmail.com> wrote:
On 10/27/16, Dan Asimov <asimov@msri.org <mailto:asimov@msri.org> <javascript:;>> wrote:
Puzzle: Define a grunch to be any closed and bounded subset of the real line R consisting entirely of rational numbers.
True or false: There is a countable set of grunches such that every grunch is a subset of one of them.
Prove your answer.