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

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

Minimal polynomial of finite field elements.

<p><p>

<h3>
Syntax:
</h3>
<pre>p := FFEltMinPoly(a);
p := FFEltMinPoly(a, J);
p := FFEltMinPoly(a, Jx);</pre>

<p>

<table>
<tr>
<td>polynomial</td>
<td><pre>  p  </pre></td>
<td></td>
</tr>
<tr>
<td>finite field element</td>
<td><pre>  a  </pre></td>
<td></td>
</tr>
<tr>
<td>finite field</td>
<td><pre>  J  </pre></td>
<td>subfield of the finite field of a</td>
</tr>
<tr>
<td>polynomial algebra in <tt> x</tt> over <tt> J</tt></td>
<td><pre>  Jx  </pre></td>
<td></td>
</tr>
</table>

<p>


See also:&nbsp;&nbsp;<a href="kashref.html#FFPrimitiveElt">FFPrimitiveElt</a>

<p>

<h3>
Description:
</h3>
This function computes the minimal polynomial of a finite field
element over the base field of the finite field or over the
finite field given as second parameter. It is also possible
to specify the polynomial algebra in which the minimal polynomial
should be.

<p><p>

<p>
<hr>
<p>
<h3>
Example:
</h3>

<pre>

</pre>

<p>


<hr>

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