61 packages found
compute the greatest common divisor using euclid's algorithm
Convert number to fraction
Some common functions for modular arithmetic using native JS implementation of BigInt
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
Compute the greatest common divisor using Iterative implementation.
convert to popular formats
Common typescript ready prototypes available in both CommonJS and ECMAScript
- server-side
- client-side
- common
- typescript
- prototype
- array
- all
- any
- append
- average
- chunk
- clone
- compact
- contains
- View more
greater common divisor (gcd) of two BigInt values using Lehmer's GCD algorithm
Lightweight utils for every project
- utils
- clean-obj
- object
- array
- lodash
- ramda
- get-enum-values
- unnest
- plain-object
- odd
- alphanumeric
- between
- cpf
- cnpj
- View more
A collection of functions for working with BigInts.
- extra
- bigint
- big
- integer
- aliquotParts
- clamp
- greatestPrimeFactor
- hcf
- leastPrimeFactor
- map
- mean
- rootMeanSquare
- abs
- aliquotSum
- View more
GCD + Euclidean algorithm
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
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
A collection of common number functions.
- extra
- number
- aliquotParts
- clamp
- greatestPrimeFactor
- hcf
- leastPrimeFactor
- map
- mean
- norm
- rootMeanSquare
- aliquotSum
- arithmeticMean
- binomial
- View more
A collection of common mathematical functions.
- extra
- math
- aliquotParts
- clamp
- greatestPrimeFactor
- hcf
- leastPrimeFactor
- map
- mean
- norm
- rootMeanSquare
- aliquotSum
- arithmeticMean
- binomial
- View more
A collection of functions for working with BigInts {web}.
- extra
- bigint
- big
- integer
- aliquotParts
- clamp
- greatestPrimeFactor
- hcf
- leastPrimeFactor
- map
- mean
- rootMeanSquare
- abs
- aliquotSum
- View more
A collection of common number functions {web}.
- extra
- number
- aliquotParts
- clamp
- greatestPrimeFactor
- hcf
- leastPrimeFactor
- map
- mean
- norm
- rootMeanSquare
- aliquotSum
- arithmeticMean
- binomial
- View more
Compute the gcd and solve Bezout's identity using the extended Euclidean algorithm.