The inverse is computed in a 'round toward \(-\infty\) mode. The result is guaranteed to be less than or equal to the exact value (except for NaNs).
The inverse is computed in a 'round toward \(\infty\) mode. The result is guaranteed to be greater than or equal to the exact value (except for NaNs).
Computes the result in modular arithmetic. the parameters must be flint positive and less than the modulus. The modulus itself must be less than maxflint. Note that mul[mod = p](a, rec[mod = p](a)) is the gcd of p and a (1 iff a and p are coprime)