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

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

Return the number of monic prime polynomials over a
finite field.

<p><p>

<h3>
Syntax:
</h3>
<pre>f := PolyPrimeNum(kx, d);</pre>

<p>

<table>
<tr>
<td>polynomial</td>
<td><pre>  f  </pre></td>
<td></td>
</tr>
<tr>
<td>polynomial algebra over k</td>
<td><pre>  kx  </pre></td>
<td></td>
</tr>
<tr>
<td>integer</td>
<td><pre>  d  </pre></td>
<td></td>
</tr>
</table>

<p>


<h3>
Description:
</h3>
For given degree d and finite field k this function returns
the number of monic prime polynomials of degree d in k[x].

<p><p>

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

<pre>

kash> k := FF(5, 2);
Finite field of size 5^2
kash> kx := PolyAlg(k, "x");
Univariate Polynomial Ring in x over GF(5^2)

kash> PolyPrimeNum(kx, 11);
> 216744162819600

</pre>

<p>


<hr>

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