Search results

20 packages found

Computes the least common multiple (lcm).

published version 1.1.2, 5 years ago11 dependents
3,962,247
3,966,819

compute the greatest common divisor using euclid's algorithm

published version 0.0.1, 11 years ago13 dependents licensed under $MIT
167,440

Compute the greatest common divisor (gcd).

published version 0.3.0, 10 months ago4 dependents licensed under $Apache-2.0
25,109

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

published version 1.0.0, 9 years ago14 dependents licensed under $MIT
3,881

Computes the square root of a sum of squares.

published version 1.0.0, 9 years ago1 dependents licensed under $MIT
940

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

published version 0.2.2, 10 months ago2 dependents licensed under $Apache-2.0
162

Compute the hypotenuse avoiding overflow and underflow.

published version 0.2.2, 10 months ago2 dependents licensed under $Apache-2.0
135

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

published version 0.3.0, 10 months ago1 dependents licensed under $Apache-2.0
109

Compute the hypotenuse.

published version 0.3.0, 10 months ago1 dependents licensed under $Apache-2.0
107

Compute the least common multiple (lcm).

published version 0.3.0, 10 months ago1 dependents licensed under $Apache-2.0
69

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

published version 0.1.0, 13 years ago3 dependents licensed under $MIT
46

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

published version 3.1.1, 3 years ago2 dependents licensed under $MIT
50

Generate Pythagorean triples using Euclid's formula

published version 1.6.0, 10 years ago0 dependents licensed under $ISC
28

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

published version 1.0.7, a year ago0 dependents licensed under $ISC
28

Euclid Graphql Codegen for React and Nodejs

published version 1.0.3, 7 months ago0 dependents licensed under $ISC
18

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

published version 1.0.0, 6 years ago0 dependents licensed under $MIT
16

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

published version 1.0.1, 6 years ago0 dependents licensed under $MIT
10

Euclid's greatest common divisor algorithm as a JavaScript component

published version 0.0.0, 8 years ago0 dependents licensed under $MIT
7

Constrain a value to lie between two further values

published version 1.0.0-alpha.0, 6 years ago0 dependents licensed under $MIT
6