GCD Packages

Convert number to fraction

Computes the greatest common divisor (gcd).

Computes the least common multiple (lcm).

compute the greatest common divisor using euclid's algorithm

Some common functions for modular arithmetic using native JS implementation of BigInt

Finds greatest common divisor of numbers.

Common typescript ready prototypes available in both CommonJS and ECMAScript

Finds greatest common divisor of numbers.

Lightweight and modular math toolbox

A number is a mathematical object used to count, measure, and label.

Mathematics is the classification and study of all possible patterns.

Use this package for simple computation purpose

A function that takes two integers and returns their greatest common divisor

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

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

A BigInt can represent whole numbers larger than 2⁵³ - 1.

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

C's and C++'s math functions in TypeScript & JavaScript

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

Fast and simple gcd/lcm implementation