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

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

Returns the extended gcd of two polynomials.

<p><p>

<h3>
Syntax:
</h3>
<pre>l := PolyXGcd(f, h);</pre>

<p>

<table>
<tr>
<td>list of polynomials</td>
<td><pre>  l  </pre></td>
<td></td>
</tr>
<tr>
<td>polynomial</td>
<td><pre>  f  </pre></td>
<td></td>
</tr>
<tr>
<td>polynomial</td>
<td><pre>  h  </pre></td>
<td></td>
</tr>
</table>

<p>


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

<p>

<h3>
Description:
</h3>
Given two polynomials f,h\in S[x] where S is a field
the function returns the gcd g of f and h
together with polynomials a b such that
g = af + bh.

<p><p>

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

<pre>

kash> Qx := PolyAlg(Q);
Univariate Polynomial Ring in x over Rational Field

kash> f := Poly(Qx, [1, 2, 3, 4, 5, 6]);
x^5 + 2*x^4 + 3*x^3 + 4*x^2 + 5*x + 6
kash> h := Poly(Qx, [1, 4, 10, 16, 22, 28, 27, 18]);
x^7 + 4*x^6 + 10*x^5 + 16*x^4 + 22*x^3 + 28*x^2 + 27*x + 18
kash> PolyXGcd(f, h);
> [ x^5 + 2*x^4 + 3*x^3 + 4*x^2 + 5*x + 6, 1, 0 ]

</pre>

<p>


<hr>

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