Module utils::number

source ·
Expand description

Traits for using numbers as generic data types.

Traits§

  • Trait implemented by the primitive integer types.
  • Trait implemented by the primitive number types, combining common supertraits.
  • Trait implemented by the primitive signed integer and floating point types.
  • Trait implemented by the primitive signed integer types.
  • Trait implemented by the primitive unsigned integer types.

Functions§

  • Solves a system of simultaneous congruences using the Chinese Remainder Theorem.
  • Computes the greatest common divisor (GCD) using the extended Euclidean algorithm.
  • Checks if the provided unsigned integer n is a prime number.
  • Computes the lowest common multiple (LCM).
  • Computes the modular inverse of a modulo b if it exists.
  • Calculates base.pow(exponent) % modulus.