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

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

Computes a greatest common divisor with respect
to the degree valuation.

<p><p>

<h3>
Syntax:
</h3>
<pre>c := InftyGcd(a, b);</pre>

<p>

<table>
<tr>
<td>quotient field elements</td>
<td><pre>  a,b,c  </pre></td>
<td></td>
</tr>
</table>

<p>


See also:&nbsp;&nbsp;<a href="kashref.html#InftyVal">InftyVal</a>, <a href="kashref.html#InftyQuotRem">InftyQuotRem</a>, <a href="kashref.html#InftyLcm">InftyLcm</a>

<p>

<h3>
Description:
</h3>
Let a, b \in FF_q(x). This function returns
x^{-min(\nu_\infty(a),\nu_\infty(b))}.

<p><p>

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

<pre>

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

kash> x := Poly(kx, [1,0]);
x
kash> InftyGcd(x^2+1, x^3+1);
x^3

</pre>

<p>


<hr>

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