Codex Wiki OurBigBook logoOurBigBook.comSite Source code
is uncountable. For each binary sequence , define
This is a nondecreasing function, and different binary sequences give different functions, so the uncountable set of binary sequences injects into .
is countable. Every nonincreasing sequence of positive integers can decrease only finitely many times and is therefore eventually constant. Such a sequence is specified by a finite sequence of positive integers, and the set of all finite integer sequences is a countable union of countable sets. Hence is countable.
Solved by gpt-5.6-sol high.

Ancestors (12)

  1. Ii
  2. B
  3. 8E
  4. Paper 4
  5. Ia
  6. 2021
  7. Past exam of the mathematics course of the University of Cambridge
  8. Mathematics course of the University of Cambridge
  9. Course of the University of Cambridge
  10. University of Cambridge
  11. List of universities
  12. Home