Showing 1-20 of 616 packages
compute the greatest common divisor using euclid's algorithm
Computes the greatest common divisor (gcd).
Compute the greatest common divisor (gcd).
TypeScript definitions for compute-gcd
greater common divisor (gcd) of two BigInt values using Lehmer's GCD algorithm
compute Greatest Common Divisor (GCD)
GCD + Euclidean algorithm
Queue-based execution and eventing for tasks (ala GCD)
Calculates the greatest common divisor of two integers.
Compute the greatest common divisor (gcd) of two single-precision floating-point numbers.
Get **Greatest Common Divisor (GCD)** using Euclidean Algorithm.
Fast and simple gcd/lcm implementation
Compute the gcd and solve Bezout's identity using the extended Euclidean algorithm.
even/calc/gcd/balance/progression/prime games
return GCD of two numbers var gcd = require('GCD'); var ans = gcd.GCD(5,6);
GCD calculation for any two given integer.
GCD function
Lightweight GCD based HTTP server for OS X & iOS (includes web based uploader & WebDAV server)
There are 5 games: brain-even, brain-calc, brain-gcd, brain-progression, brain-prime
Calculates divisors/factors of natural numbers and gcd/lcm using euclid's algorithm.