
It is clear that

is algebraic so let its minimal polynomial have degree

Letting

be the conjugates of

in
![$ \mathbb{Q}[\alpha] $](//latex.artofproblemsolving.com/e/c/2/ec22a375f8618bdd93caa7bfe3b1daf12682ee5f.png)
we can define

where

is the smallest positive integer such that
![$ f \in \mathbb{Z}[x] $](//latex.artofproblemsolving.com/e/4/9/e495a713b336c2e0d372976eb8cbc2dc07f1a7e3.png)
(in other words, such that

is primitive).
Now letting

we have by Gauss's Lemma that

is primitive.
Defining

similarly and continuing in this fashion we have for all

that

is primitive where
Now since

is an algebraic integer for all

we have for all

that

is an integer polynomial.
This implies that

is an integer for all

(since the
's are primitive). But this is clearly false unless

which implies that

is an algebraic integer as desired.

Hmm is it me or is the previous problem much harder? First, assume WLOG that

is primitive. Basically define

Assume that
![$ g_1(x) \in \mathbb{Z}[[x]]. $](//latex.artofproblemsolving.com/0/5/5/055b0491cce5faf5dc76f082981ea91f60de3dd4.png)
Then usng product rule we have that

and upon dividing by

we find that

so by an easy induction we get that
![$ g_k(x) \in \mathbb{Z}[[x]] $](//latex.artofproblemsolving.com/a/0/5/a050dcd7bbbd7988a7fb5a69b034426e062d05c0.png)
for all
Now we get that

and since

is primitive this implies that

Writing the product as

and letting

implies that

for all

as desired so the answer is yes.

Well they both use Gauss's Lemma so yeah

By the Frobenius endomorphism we have that

and upon expanding and rearranging and dividing by

we immediately obtain the desired result.