compute-gcd
Computes the greatest common divisor (gcd).
Computes the greatest common divisor (gcd).
Computes the least common multiple (lcm).
Calculate the Euclidean distance been two points in 2D/3D/nD space.
compute the greatest common divisor using euclid's algorithm
Computes the square root of a sum of squares.
Compute the gcd and solve Bezout's identity using the extended Euclidean algorithm.
Calculates the patterns based on the euclidean/bjorklund's algorithm
Euclid's greatest common divisor algorithm as a JavaScript component
glsl implementation of the Euclid's algorithm for the calculation of the greatest common divisor.
Generate Pythagorean triples using Euclid's formula
Compute the greatest common divisor (gcd).
Compute the least common multiple (lcm).
Compute the hypotenuse using the alpha max plus beta min algorithm.
Compute the hypotenuse.
Compute the hypotenuse avoiding overflow and underflow.
Compute the hypotenuse avoiding overflow and underflow (single-precision).
Constrain a value to lie between two further values
This library provides a simple way to do math operations in base 100