1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
<html>
<head><title>MOD-EXPT.html -- ACL2 Version 3.1</title></head>
<body text=#000000 bgcolor="#FFFFFF">
<h2>MOD-EXPT</h2>exponential function
<pre>Major Section: <a href="PROGRAMMING.html">PROGRAMMING</a>
</pre><p>
<code>(mod-expt r i m)</code> is the result of raising the number <code>r</code> to the
integer power <code>i</code> and then taking the residue mod <code>m</code>. That is,
<code>(mod-expt r i m)</code> is equal to <code>(mod (expt r i) m)</code>.
<p>
The <a href="GUARD.html">guard</a> for <code>(mod-expt r i m)</code> is that <code>r</code> is a rational number
and <code>i</code> is an integer; if <code>r</code> is <code>0</code> then <code>i</code> is nonnegative; and
<code>m</code> is a non-zero rational number.<p>
In some implementations (GCL Version 2.7.0 as of this writing), this function
is highly optimized when <code>r</code> and <code>i</code> are natural numbers, not both zero,
and <code>m</code> is a positive integer.
<br><br><br><a href="acl2-doc.html"><img src="llogo.gif"></a> <a href="acl2-doc-index.html"><img src="index.gif"></a>
</body>
</html>
|
