27 Oct
2016
27 Oct
'16
7:25 p.m.
Yes, it is a nice question. I wish I'd thought of it (but it wasn't me). —Dan
On Oct 27, 2016, at 5:13 PM, James Propp <jamespropp@gmail.com> wrote:
Nice question, Dan! If I didn't have to grade midterm exams for the next several hours, I'd definitely play with this puzzle right now. Maybe I'll think about it as I drift off to hard-earned sleep tonight...
Jim Propp
On Thu, Oct 27, 2016 at 3:04 PM, Dan Asimov <asimov@msri.org> 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.