Get **Greatest Common Divisor (GCD)** using Euclidean Algorithm.
Computes the greatest common divisor (gcd).
compute the greatest common divisor using euclid's algorithm
Compute the greatest common divisor (gcd).
Avatar style for DiceBear
Stylish, intuitive and user-friendly prompt system. Fast and lightweight enough for small projects, powerful and extensible enough for the most advanced use cases.
Make a directory and its parents if needed - Think `mkdir -p`
Fun with Iterables
A generalized and simple hooking API for adding extensibility to applications
Local Lambda development environment
Calculates the greatest common divisor of two integers.
TypeScript definitions for compute-gcd
TypeScript SDK for Pump Agent Payments
No description provided.
Powerful mathematics and statistics library for JavaScript.
Opal Runtime for Asciidoctor.js
The magical sticky regex-based parser generator 🧙
A browserify implementation of node-bignum
Opal Runtime for Asciidoctor.js
Real profanity words banned by Google, extracted from their hidden API before shutdown. Now available as an easy-to-use Node.js library for content filtering.
GCD + Euclidean algorithm
Winston-lite-esque Log lib for terminal and browser debugging, with piles of unignorable log tags and marker styles.
greater common divisor (gcd) of two BigInt values using Lehmer's GCD algorithm
simple, flexible, fun test framework