D.4.4.10 primTest
.................
Procedure from library mprimdec.lib (see mprimdec_lib).

Usage:
primTest(i[, p]); a zero-dimensional ideal i, irreducible poly p in i

Return:
if i neither is prime nor is homogeneous then ideal(0) is returned,
else radical(i)

Example:
LIB "mprimdec.lib";
ring r=0,(x,y,z),lp;
ideal i=x+1,y-1,z;
i=std(i);
ideal primId=primTest(i,z);
primId;
==> primId[1]=z
==> primId[2]=y-1
==> primId[3]=x+1
i=x,z2,yz,y2;
i=std(i);
primId=primTest(i);
primId;
==> primId[1]=x
==> primId[2]=y
==> primId[3]=z

<font size="-1">
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; User manual for <a href="http://www.singular.uni-kl.de/"><i>Singular</i></a> version 2-0-4, October 2002,
generated by <a href="http://www.gnu.org/software/texinfo/"><i>texi2html</i></a>.
</font>

</body>
</html>
