[back] [prev] [next] [index] [root]

<p>&nbsp;<p>
<hr noshade size="5">
<h2><a name="PolyRoundFour"></a>
PolyRoundFour
</h2>

Returns the factorization of the given polynomial over the p-adic
integers and certificates for the irreducibility of the factors.

<p><p>

<h3>
Syntax:
</h3>
<pre>L := PolyRoundFour(f);
L := PolyRoundFour(f, p);
L := PolyRoundFour(f, p, m);</pre>

<p>

<table>
<tr>
<td>list</td>
<td><pre>  L  </pre></td>
<td></td>
</tr>
<tr>
<td>polynomial</td>
<td><pre>  f  </pre></td>
<td></td>
</tr>
<tr>
<td>prime number</td>
<td><pre>  p  </pre></td>
<td></td>
</tr>
<tr>
<td>integer</td>
<td><pre>  m  </pre></td>
<td></td>
</tr>
</table>

<p>


See also:&nbsp;&nbsp;<a href="kashref.html#Factor">Factor</a>, <a href="kashref.html#PolyFactor">PolyFactor</a>, <a href="kashref.html#OrderMaximal">OrderMaximal</a>

<p>

<h3>
Description:
</h3>
This function returns the factorization of the
given polynomial over the p-adic inetegers.
Supported ring types are: Z, Q, and Q_p.
If the polynomial is not given over Q_p a prime number p
as a second parameter is needed. The desired precision can be given
as a third parameter.

<p><p>


<hr>

<p>
<a href="../kashref.html"><- back</a>[back] [prev] [next] [index] [root]