For fixed $n \in \mathbb{N}$, let $A_n$ be he set of all algebraic numbers obtained as roots of polynomials with integer coefficients that have degree $n$. Proof that $A_n$ is countable. (Hint: For each $m \in \mathbb{N}$, consider polynomials with $\sum_{i=0}^n |a_i| \leq m$.
My main problem is that I don't understand why $\sum_{i=0}^n |a_i|$ should be $\leq m$ and not equal to $m$. I would go as follows:
Let $m \in \mathbb{N}$. Then there are only finitely many polynomials of degree $n$ having integer coefficients satisfying $\sum_{i=0}^n |a_i| = m$, because there are only finitely many ways how the coefficients can be chosen. Hences, let $n_m$ be the number of these polynomials, and let $S^m_i$ be the set of solutions of the $i$th of such polynomials, $1 \leq i \leq n_m$. Since a polynomial of degree $n$ has at most $n$ solutions, $S^m_i$ is finite for all $m \in \mathbb{N}$ and all $1 \leq i \leq n_m$. Then, $S^m = \cup_{i=1}^{n_m} S^m_i$ is finite. Because each polynomial with integer coefficients falls in exactly one class for the sum of the absolute values of its coefficients, $A_n = \cup_{m=1}^{\infty} S^m$, and since the countable union of finite sets is countable, $A_n$ is countable.
Best Answer
You can prove it either way. If you restrict either $\sum|a_i|=m$ or $\sum|a_i|\leq m$, you'll end up with a finite number of polynomials in your set. In the case of $\sum|a_i|\leq m$ you'll end up overcounting polynomials. However, either way you'll prove there is at MOST countably many, and since the naturals are all algebraic there are at LEAST countably many, so overcounting shouldn't worry you. And you'll be overcounting the algebraic numbers no matter what, even if you don't overcount polynomials. since different polynomials will end up having roots in common.