4.9. Cross-references🔗

• HexArith provides the extended Euclidean algorithm used by every push.

• HexModArith provides arithmetic modulo word-sized primes, in which the images of a multimodular computation are usually computed.

• HexPolyFp multiplies polynomials with number theoretic transforms modulo several primes and combines the results with a Hex.Modular.CrtPlan.

• HexModularMatrix computes determinants with crtLoop and solves linear systems with ratReconVec?.

• HexPolyZGcd and HexMvGcd combine the coefficients of polynomial greatest common divisors computed modulo several primes with CrtVec and Crt.

• HexMvHensel uses symmetric representatives to read integer coefficients from coefficients modulo a prime power.