AngouriMath

Navigation

← Back to list of members

Inverse​(System.​Int64,​System.​Int64)

 Method (no overloads)

Summary

The inverse of value modulo prime, by the
extended Euclidean algorithm. Exposed because the Gaussian elimination in
PrimeFieldFactorization works on the field rather than on
polynomials over it and needs the same inversion.

Exception "DivideByZeroException"

value has no inverse — it is zero modulo
prime, or the modulus is not prime.

























Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online