I have to show :
If $I = (p(x))$ is a prime ideal in $F[x]$, where F is a field, then $p(x)$ is irreducible.
In the book I use, there is the proof of the converse which uses Euclid's Lemma.
I tried to suppose $I=(p(x))$ is an ideal, then every polynomial in I is divisible by $p(x)$. Then for $a(x)b(x) \in F[x]$ we have $a(x)b(x)=p(x)q(x)$ for $q(x) \in F[x]$ with $\delta a<\delta p$ and $\delta b<\delta p$.
From there, I don't see how to deduce $p(x)$ is irreducible ie there is no factorisation over F $p(x)=c(x)d(x) \in F[x]$ with $\delta c < \delta p$ and $\delta d < \delta p$
We could express $p(x)$ in function of $a(x),b(x)$ and $g(x)$ but it does not help.
Any hints ? :) Thanks
Suppose $p(x)=c(x)d(x)$, i.e. $p(x)$ is reducible. Since $c(x)d(x)=p(x)\in(p(x))$, either $c(x)\in(p(x))$ or $d(x)\in(p(x))$. Without loss the former, so $p(x)|c(x)$, and also $c(x)|p(x)$. Hence $c,p$ are associates, so $d$ is a unit, which contradicts the reducibility assumption.