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

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

Returns a generator of a finite field.

<p><p>

<h3>
Syntax:
</h3>
<pre>a := FFGenerator(F);
a := FFGenerator(F, k);</pre>

<p>

<table>
<tr>
<td>finite field element</td>
<td><pre>  a  </pre></td>
<td></td>
</tr>
<tr>
<td>finite field</td>
<td><pre>  F  </pre></td>
<td></td>
</tr>
<tr>
<td>subfield of F</td>
<td><pre>  k  </pre></td>
<td></td>
</tr>
</table>

<p>


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

<p>

<h3>
Description:
</h3>
Given a finite field extension F/k of degree d the function
returns a \in F such that
F = kcdot 1 + kcdot a +  &hellip;  + kcdot a^{d-1}. If k is
omitted in the function call, it is assumed to be the base field.

<p><p>

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

<pre>

kash> F25 := FF(5, 2);
Finite field of size 5^2
kash> a := FFGenerator(F25);
w
kash> y := FFPrimitiveElt(F25);
w
kash> F5 := FF(5);
Finite field of size 5
kash> b := FFGenerator(F5);
1
kash> z := FFPrimitiveElt(F5);
2
kash> F64 := FF(2, 6);
Finite field of size 2^6
kash> FFGenerator(F64, F64);
w
kash> FFGenerator(F64, FF(2,2));
> w

</pre>

<p>


<hr>

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