Use the norm N(a+b−n)=a2+nb2. If n is composite, compare n=(−n)(−−n) with an integer factorisation; if n is prime, n is odd and n+1=(1+−n)(1−−n)has a nontrivial integer factorisation. Norm considerations show the relevant factors are irreducible and nonassociate, so unique factorisation fails.
At the maximal idealm=(2,X), the images of 4,2X,X2 form a three-dimensional basis of I/mI over F2, so two generators are impossible. More generally (2n−1,2n−2X,…,2Xn−2,Xn−1) needs exactly n generators by the same argument.