drygdryg/calc
1
0
Fork 0
mirror of https://github.com/lcn2/calc.git synced 2025-08-16 01:03:29 +03:00
Code Issues Packages Projects Releases Wiki Activity

Release calc version 2.11.0t10

Browse Source
This commit is contained in:
Landon Curt Noll
1999-11-11 05:15:39 -08:00
parent 86c8e6dcf1
commit 96c34adee3
283 changed files with 2380 additions and 3032 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
help/rcpow
View File

@@ -14,7 +14,7 @@ TYPES
DESCRIPTION
Let B be the base calc uses for representing integers internally
(B = 2^16 for 32-bit machines, 2^32 for 64-bit machines) and N the
number of words (base-B digits) in the representation of m. Then
number of words (base-B digits) in the representation of m. Then
rcpow(x,k,m) returns the value of B^-N * (B^N * x)^k % m, w here
the inverse implicit in B^-N is modulo m and the modulus operator %
gives the least nonnegative residue. Note that rcpow(x,0,m) =
@@ -43,7 +43,7 @@ RUNTIME
in a REDC function, the information required for the REDC
algorithms is calculated and stored for future use, possibly
replacing an already stored valued, in a table covering up to 5
(i.e. MAXREDC) values of m. The runtime required for this is about
(i.e. MAXREDC) values of m. The runtime required for this is about
two times that required for multiplying two N-word integers.
Two algorithms are available for evaluating rcpow(x,k,m), the one