53 packages found
Convert number to fraction
Compute the greatest common divisor (gcd).
- stdlib
- stdmath
- math
- mathematics
- euclid
- euclidean
- stein
- binary gcd
- greatest common divisor
- greatest common factor
- highest common factor
- greatest common measure
- highest common divisor
- gcd
- View more
Compute the least common multiple (lcm).
- stdlib
- stdmath
- math
- mathematics
- euclid
- euclidean
- least common multiple
- lowest common multiple
- smallest common multiple
- lowest common denominator
- lcm
- lcd
- discrete
- arithmetic
- View more
Use this package for simple computation purpose
Computes the least common multiple (lcm).
- compute.io
- compute
- computation
- mathematics
- math
- least common multiple
- lowest common multiple
- smallest common multiple
- lowest common denominator
- lcm
- lcd
- discrete
- arithmetic
- array
- View more
Common typescript ready prototypes available in both es5 and es6
- server-side
- client-side
- common
- typescript
- prototype
- array
- all
- any
- append
- average
- chunk
- clone
- compact
- contains
- View more
Computes the greatest common divisor (gcd).
- compute.io
- compute
- computation
- mathematics
- math
- euclid
- stein
- binary gcd
- greatest common divisor
- greatest common factor
- highest common factor
- greatest common measure
- highest common divisor
- gcd
- View more
Integers for JavaScript
- abitrary
- addition
- algorithm
- arithmetic
- big
- big-int
- big-integer
- big-integers
- big-num
- big-number
- big-numbers
- bigint
- biginteger
- bigintegers
- View more
Some common functions for modular arithmetic using native JS implementation of BigInt
compute the greatest common divisor using euclid's algorithm
Get the greatest common devisor of two numbers
Compute the greatest common divisor using Iterative implementation.
GCD + Euclidean algorithm
convert to popular formats
There are 5 games: brain-even, brain-calc, brain-gcd, brain-progression, brain-prime
Calculates divisors/factors of natural numbers and gcd/lcm using euclid's algorithm.
- divisor
- common divisors
- greatest common divisor
- gcd
- greatest common factor
- gcf
- greatest common measure
- gcm
- least common multiple
- lowest common multiple
- smallest common multiple
- lcm
- euclidean algorithm
- euclid's algorithm
Pollard's rho algorithm implemented in Node.js with long arithmetics
Mathematics is the classification and study of all possible patterns.
Finds greatest common divisor of numbers.