Lines Matching refs:Modulus
207 // Rem implements truncated modulus (like Go); see QuoRem for more details.
218 // QuoRem implements T-division and modulus (like Go):
223 // (See Daan Leijen, ``Division and Modulus for Computer Scientists''.)
224 // See DivMod for Euclidean division and modulus (unlike Go).
249 // Mod sets z to the modulus x%y for y != 0 and returns z.
251 // Mod implements Euclidean modulus (unlike Go); see DivMod for more details.
269 // DivMod sets z to the quotient x div y and m to the modulus x mod y
273 // DivMod implements Euclidean division and modulus (unlike Go):
282 // See QuoRem for T-division and modulus (like Go).
426 // make modulus result positive
705 modulus p must be an odd prime. If x is not a square mod p,
