Returns a list of 3 integers
(d x y)such that d = gcd(n1, n2) = n1 * x + n2 * y.
For odd positive integer m, returns an object suitable for passing as the first argument to
modular:procedures, directing them to return a symmetric modular number, ie. an n such that(<= (quotient m -2) n (quotient m 2)
Returns the non-negative integer characteristic of the ring formed when modulus is used with
modular:procedures.
Returns the integer
(modulon(modular:characteristicmodulus))in the representation specified by modulus.
The rest of these functions assume normalized arguments; That is, the arguments are constrained by the following table:
For all of these functions, if the first argument (modulus) is:
positive?zero?Otherwise, if modulus is a value returned by
(symmetric:modulus radix), then the arguments and
result are treated as members of the integers modulo radix,
but with symmetric representation; i.e.
(<= (quotient radix 2) n (quotient (- -1 radix) 2)
If all the arguments are fixnums the computation will use only fixnums.
Returns
#tif there exists an integer n such that k * n == 1 mod modulus, and#fotherwise.
Returns an integer n such that 1 = (n * n2) mod modulus. If n2 has no inverse mod modulus an error is signaled.