mirror of
https://github.com/lcn2/calc.git
synced 2025-08-19 01:13:27 +03:00
Release calc version 2.11.0t10
This commit is contained in:
@@ -13,7 +13,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
|
||||
rcin(x,m) returns the value of B^N * x % m, where the modulus
|
||||
operator % here gives the least nonnegative residue.
|
||||
|
||||
@@ -29,7 +29,7 @@ DESCRIPTION
|
||||
|
||||
rcin(x^k, m) = rcpow(rcin(x,m), k, m).
|
||||
|
||||
Here k is any nonnegative integer. Using these formulae may be
|
||||
Here k is any nonnegative integer. Using these formulae may be
|
||||
faster than direct evaluation of x * y % m, x^2 % m, x^k % m.
|
||||
Some encoding and decoding may be bypassed by formulae like:
|
||||
|
||||
|
Reference in New Issue
Block a user