Showing 1-20 of 147 packages
compute the least common multiple using Euclidean algorithm
Computes the least common multiple (lcm).
TypeScript definitions for lcm
TypeScript definitions for compute-lcm
Compute the least common multiple (lcm).
Compute the least common multiple (lcm) of two single-precision floating-point numbers.
Simple tool to return the LCM of any two given integers.
lcm-requester is a wrapper on request module with validation on top of format and rules used
Fast and simple gcd/lcm implementation
metadata selector
Calculates divisors/factors of natural numbers and gcd/lcm using euclid's algorithm.
Stable Diffusion plugin based on Apple's Core ML port
LCM function
A BigInt can represent whole numbers larger than 2⁵³ - 1.
To calculate the Greatest Common Divisor(GCD) and Least Common Multiple(LCM) of given two numbers.
react-native library for wechat app
Decimal-safe math for JavaScript/TypeScript - accurate arithmetic (add, sub, mul, div, round) without floating-point errors. Plus factorial, prime numbers, fibonacci, GCD, LCM, number conversions, perfect numbers, Armstrong numbers, and more. Perfect for
Componente para agregar una React-Table que reciba datos desde el api de pagos LCM
This library was generated with [Angular CLI](https://github.com/angular/angular-cli) version 7.2.0.
An implementation to speed up the nodejs `dns.lookup` method by avoiding thread pool and using resolve4/resolve6 with DNS TTL values