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

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

Returns greatest common divisor of list of arguments.

<p><p>

<h3>
Syntax:
</h3>
<pre>gcd := Gcd(L);
gcd := Gcd(a, b);</pre>

<p>

<table>
<tr>
<td>integer or polynomial or ideal</td>
<td><pre>  gcd  </pre></td>
<td></td>
</tr>
<tr>
<td>list of integers of polynomials or ideals</td>
<td><pre>  L  </pre></td>
<td></td>
</tr>
<tr>
<td>integer or polynomial or ideal</td>
<td><pre>  a  </pre></td>
<td></td>
</tr>
<tr>
<td>integer or polynomial or ideal</td>
<td><pre>  b  </pre></td>
<td></td>
</tr>
</table>

<p>


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

<p>

<h3>
Description:
</h3>
Returns the greatest common divisor of list of arguments or simply the
greatest common divisor of two arguments. Supported are integers,
ideals and polynomials over  S where S is a field or Z .

<p><p>

<p>
<hr>
<p>
<h3>
Example:
</h3>
Gcd of integers:
<pre>

kash> Gcd([18, 12, 4, 6]);
2
kash> Gcd(18, 12);
6
kash> Gcd([18, 12]);
> 6

</pre>

<p>


<hr>

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