JSPM

Computes the greatest common divisor (gcd).

Computes the least common multiple (lcm).

compute the greatest common divisor using euclid's algorithm

Compute the greatest common divisor (gcd).

Calculate the Euclidean distance been two points in 2D/3D/nD space.

Computes the square root of a sum of squares.

Calculates the patterns based on the euclidean/bjorklund's algorithm

JavaScript library for working with objects in a two-dimensional coordinate system.

Compute the hypotenuse avoiding overflow and underflow (single-precision).

Compute the hypotenuse using the alpha max plus beta min algorithm.

Euclid Graphql Codegen for React and Nodejs

Compute the least common multiple (lcm).

Compute the hypotenuse avoiding overflow and underflow.

Generate Pythagorean triples using Euclid's formula

This library provides a simple way to do math operations in base 100

Compute the gcd and solve Bezout's identity using the extended Euclidean algorithm.

Compute the hypotenuse.

glsl implementation of the Euclid's algorithm for the calculation of the greatest common divisor.

Constrain a value to lie between two further values

Euclid's greatest common divisor algorithm as a JavaScript component