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

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

Returns the factorization of the given polynomial.

<p><p>

<h3>
Syntax:
</h3>
<pre>F := PolyFactor(f);
F := PolyFactor(f, p);
F := PolyFactor(f, p, m);</pre>

<p>

<table>
<tr>
<td>list</td>
<td><pre>  F  </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>

<p>

<h3>
Description:
</h3>
This function returns the factorization of the
given polynomial over its coefficient ring.
Supported ring types are: Z, Q, FF|p, O,
and Q_p.

If the polynomial has coefficients in Z, a second
argument p may be specified to obtain the
factorization modulo (the prime) p.

If the polynomial has coefficients in Z or Q and it is monic
an approximation to a p-adic factorization can be obtained by giving a
prime number p and a precision m.

<p><p>

<p>
<hr>
<p>
<h3>
Example:
</h3>
Factorization of the polynomial f(x)=4x^7+6x^6+12x^5+14x^4+27x^3+24x^2+30x+9\in{\Bbb Z}[x]:
<pre>

kash> f := Poly(Zx, [4,6,12,14,27,24,30,9]);
4*x^7 + 6*x^6 + 12*x^5 + 14*x^4 + 27*x^3 + 24*x^2 + 30*x + 9
kash> Factor(f);
> [ [ 2*x^2 + x + 3, 1 ], [ 2*x^5 + 2*x^4 + 2*x^3 + 3*x^2 + 9*x + 3, 1 ] ]

</pre>

<p>


<hr>

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