Codex Wiki OurBigBook logoOurBigBook.comSite Source code
For each degree and coefficient bound there are finitely many integer polynomials. Hence is countable. Every nonzero polynomial has finitely many roots, and every algebraic number is a root of one of these polynomials. A countable union of finite sets is countable.
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. A
  2. 2G
  3. Paper 4
  4. Ii
  5. 2024
  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