Ask your own question, for FREE!
Mathematics 16 Online
OpenStudy (usukidoll):

Question: A number is said to be algebraic if it is the root (zero) of a polynomial with integer coefficients. Show that the set of algebraic numbers is countable.

OpenStudy (usukidoll):

By Lemma 7.3.13, the set \(Z[x]\) of all polynomial functions with integer coefficients is countable. By Theorem 7.3.15, the set of algebraic numbers is countable. If \(p\) is a polynomial function, then a number \(z\) is a root of \(p\) if \(p(x)=0\). For example, the roots of the function \(x^3-3x-2\) are \(-1\) and \(-2\). The number of roots of any polynomial function is finite. Since the set \(Z\) is countable, the Cartesian product of finitely many copies of \(Z\) is a countable set. It follows that each set \(P_n\) is also a countable set.

OpenStudy (usukidoll):

sigh don't know what happens next..

OpenStudy (usukidoll):

I get stuck afterwards...

OpenStudy (usukidoll):

I'm not even sure if this is correct... x.x

OpenStudy (anonymous):

Okay, so here is my idea...

OpenStudy (anonymous):

If you can map to a vector with \(n\) elements, then you can map to a degree \(n\) polynomial. Just let the vector components be the coefficients.

OpenStudy (anonymous):

Basically: \[ f(a_0,a_1,a_2,\ldots , a_n) = \sum_{k=0}^{n} a_kx^k \]

OpenStudy (usukidoll):

|dw:1397271994523:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!