compute the greatest common divisor using euclid's algorithm

Computes the greatest common divisor (gcd).

Compute the greatest common divisor (gcd).

GCD + Euclidean algorithm

TypeScript definitions for compute-gcd

greater common divisor (gcd) of two BigInt values using Lehmer's GCD algorithm

Queue-based execution and eventing for tasks (ala GCD)

compute Greatest Common Divisor (GCD)

Get **Greatest Common Divisor (GCD)** using Euclidean Algorithm.

A small collection of handy number utility functions - even/odd, prime, factorial, gcd, lcm, clamp, average, and more.

even/calc/gcd/balance/progression/prime games

Compute the greatest common divisor (gcd) of two single-precision floating-point numbers.

GCD function

Number-theory toolkit: deterministic Miller-Rabin primality, sieve, factorization, Euler totient, gcd/lcm and modular exponentiation.

Calculates divisors/factors of natural numbers and gcd/lcm using euclid's algorithm.

To calculate the Greatest Common Divisor(GCD) and Least Common Multiple(LCM) of given two numbers.

There are 5 games: brain-even, brain-calc, brain-gcd, brain-progression, brain-prime

Fast and simple gcd/lcm implementation

Calculates the greatest common divisor of two integers.

An advanced mathematical, statistical (mean, median, mode, standard deviation) and combinatorial (nCr, nPr, GCD, LCM) utility package.