Are polynomials with integer coefficients uniquely determined by their coefficients? Assume f and g are polynomials, where f = g. More explicitly;
$$ f = a_{n}z^{n} + \ldots + a_{1}z + a_{0} = b_{n}z^{n} + \ldots + b_{1}z + b_{0} = g $$
where $ \ \ a_{0} \ , \ldots, \ a_{n} \in \mathbb {Z}, \  and \ z \in \mathbb{C} $
then $$ a_{0} = b_{0} \ , \ldots, \  a_{n} = b_{n} $$
Attempted proof:
$ f - g = 0 $, thus we can now equate coefficients;
i.e.  $$ a_{0} - b_{0} = 0 \ , \ldots, \ a_{n} - b_{n} = 0 $$ 
$$ \implies a_{0} = b_{0} \ , \ldots, \ a_{n} = b_{n} $$ 
$\square$
So, is this essentially stating that polynomials are uniquely determined by there coefficients?
This question is spurred as I am trying to prove that the set of all algebraic numbers is countable, and consequently my proof will in turn rely upon such a statement as this, since if each polynomial is uniquely determined in this manner, then we should be able to find some (not exactly sure if it will be an isomorphism or just a monomorphism?) correspondence between the set of all polynomials with integer coefficients of degree n and the set of all n-tuples with integer components.
I believe we can then show that this set of all n-tuples with integer coefficients will be countable, because it will be the cartesian product:
$$ \mathbb{Z} \times \ldots \times \ \mathbb{Z} \cong \mathbb{Z}^{n} $$ 
and the finite cartesian product of countable sets is countable. We then can see that the set of all polynomials with integer coefficients is countable, which i feel puts me a step closer to solving said problem.
I feel that given this to be true, then as all polynomials only have a finite number of zeroes, we can use that the countable union of finite sets is countable to finish the proof.
Does this seem like a feasible plan for proving the statement?

A polynomial as algebraic entity, contrary to the polynomial function, is defined as the sequence of its coefficients. That way your question does not arise.
Thus the real question should be: while mapping polynomials to polynomial functions, is there more than one way to obtain the zero function? And yes, in general there is, for instance for polynomials over $\Bbb Z_2$. But not for polynomial over fields of characteristic $0$.
But does that really matter for your question? If two different polynomials have the same root, then you have some roots multiply counted (that will happen anyway if you are not able to restrict the set of polynomials to irreducible ones). So less roots than your bound, but that may happen anyway if the bound is not exact. Inexact bounds are often less work.
