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

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

Computes the Euler-\phi function of n,
i.e. the number of coprime integers less than n.

<p><p>

<h3>
Syntax:
</h3>
<pre>a := IntEulerPhi(n);</pre>

<p>

<table>
<tr>
<td>integer</td>
<td><pre>  a  </pre></td>
<td></td>
</tr>
<tr>
<td>integer</td>
<td><pre>  n  </pre></td>
<td></td>
</tr>
</table>

<p>


<h3>
Description:
</h3>
<i>no detailed description available yet</i>

<p><p>

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

<pre>
kash> IntEulerPhi(3);
2
kash> IntEulerPhi(81);
54
kash> IntEulerPhi(134);
> 66

</pre>

<p>


<hr>

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