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

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

Returns the non-negative greatest common divisor of two integers.

<p><p>

<h3>
Syntax:
</h3>
<pre>gcd := IntGcd (a1,a2);</pre>

<p>

<table>
<tr>
<td>integer</td>
<td><pre>  gcd  </pre></td>
<td></td>
</tr>
<tr>
<td>integer</td>
<td><pre>  a1  </pre></td>
<td></td>
</tr>
<tr>
<td>integer</td>
<td><pre>  a2  </pre></td>
<td></td>
</tr>
</table>

<p>


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

<p>

<h3>
Description:
</h3>
IntGcd(a,0) or IntGcd(0,a) is the absolute value of a.
IntGcd(0,0) is 0.

<p><p>

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

<pre>

kash> IntGcd(9, 0);
9
kash> IntGcd(-9, 0);
9
kash> IntGcd(0, 7);
7
kash> IntGcd(0, -7);
7
kash> IntGcd(2345, -505);
5
kash> IntGcd(2345, 505);
> 5

</pre>

<p>


<hr>

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