ads_rs::v1

Module math

Source

Functions§

  • Finds an extended GCD (Greatest Common Divisor) for a pair of numbers.
    “Extended” means that algorithm will return not only GCD, but two coefficients x and y such that the equality
  • Finds an GCD (Greatest Common Divisor) for a pair of numbers.
  • Finds the GCD (Greatest Common Divisor) for an array of elements.
  • Finds an LCM (Least Common Multiple) for a pair of numbers.
  • Finds the LCM (Least Common Multiple) for an array of elements.