Compute the greatest common divisor.
Computes the greatest common divisor (gcd).
compute the greatest common divisor using euclid's algorithm
Compute the greatest common divisor (gcd).
Calculates the greatest common divisor of two integers.
TypeScript definitions for compute-gcd
Powerful mathematics and statistics library for JavaScript.
A browserify implementation of node-bignum
greater common divisor (gcd) of two BigInt values using Lehmer's GCD algorithm
GCD + Euclidean algorithm
compute Greatest Common Divisor (GCD)
Queue-based execution and eventing for tasks (ala GCD)
A javascript library for doing fractional arithmetic
A modern JavaScript library for number theory and modular arithmetic — including primes, totients, modular inverses, and more.
Functional JavaScript library
Hexlet-project-1/Brain-games
Lightweight functional utility library complementing ES6
Compute the greatest common divisor (gcd) of two single-precision floating-point numbers.
Games with numbers
First JS project on Hexlet
react-native-perf-stats
This a brain-games project from Hexlet
A modern, accessible TypeScript Web Component slider supporting horizontal, vertical, and range modes with ticks, labels, tooltips, and form integration.
Get the greatest common devisor of two numbers