Countable, uncountable sets

  • Thread starter alphonsas
  • Start date
  • #1
3
0

Homework Statement



A complex number z is said to be algebraic if there are integers
a0; a1...; an not all zero such that z is a root of the polynomial,
Prove that the set of all algebraic numbers is countable.

Homework Equations





The Attempt at a Solution



For every natural number N there are only finitely many such polynomials

But how to prove the set is countable
 

Answers and Replies

  • #2
Office_Shredder
Staff Emeritus
Science Advisor
Gold Member
3,758
104
For every natural number N there are only finitely many such polynomials
Finitely many such polynomials that do what?
 

Related Threads on Countable, uncountable sets

Replies
1
Views
2K
  • Last Post
Replies
12
Views
16K
Replies
1
Views
2K
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
2
Views
3K
  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
3
Views
3K
  • Last Post
Replies
12
Views
9K
Top