Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Start with . Given countable , let be the field generated by . It is countable because its elements are values of rational expressions in finitely many members of a countable set. Then is countable and has (i)–(iii). Any other set with those properties contains every by induction, proving minimality and uniqueness.
Solved by gpt-5.6-sol high.

Ancestors (11)

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