Search results
65 packages found
Sort by: Default
- Default
- Most downloaded this week
- Most downloaded this month
- Most dependents
- Recently published
Convert number to fraction
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
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
Some common functions for modular arithmetic using native JS implementation of BigInt
compute the greatest common divisor using euclid's algorithm
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
A BigInt can represent whole numbers larger than 2⁵³ - 1.
- extra
- bigint
- big
- integer
- aliquotParts
- clamp
- greatestPrimeFactor
- hcf
- leastPrimeFactor
- map
- mean
- rootMeanSquare
- abs
- aliquotSum
- View more
Queue-based execution and eventing for tasks (ala GCD)
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
A number is a mathematical object used to count, measure, and label.
- extra
- number
- aliquotParts
- clamp
- fromRoman
- greatestPrimeFactor
- hcf
- leastPrimeFactor
- map
- mean
- norm
- rootMeanSquare
- toRoman
- aliquotSum
- View more
Mathematics is the classification and study of all possible patterns.
- extra
- math
- aliquotParts
- clamp
- greatestPrimeFactor
- hcf
- leastPrimeFactor
- map
- mean
- norm
- rootMeanSquare
- aliquotSum
- arithmeticMean
- binomial
- View more
greater common divisor (gcd) of two BigInt values using Lehmer's GCD algorithm
GCD + Euclidean algorithm
Mathematics is the classification and study of all possible patterns {web}.
- extra
- math
- aliquotParts
- clamp
- greatestPrimeFactor
- hcf
- leastPrimeFactor
- map
- mean
- norm
- rootMeanSquare
- aliquotSum
- arithmeticMean
- binomial
- View more
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
A BigInt can represent whole numbers larger than 2⁵³ - 1 {web}.
- extra
- bigint
- big
- integer
- aliquotParts
- clamp
- greatestPrimeFactor
- hcf
- leastPrimeFactor
- map
- mean
- rootMeanSquare
- abs
- aliquotSum
- View more
Lightweight and modular math toolbox
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
Pollard's rho algorithm implemented in Node.js with long arithmetics
A number is a mathematical object used to count, measure, and label {web}.
- extra
- number
- aliquotParts
- clamp
- fromRoman
- greatestPrimeFactor
- hcf
- leastPrimeFactor
- map
- mean
- norm
- rootMeanSquare
- toRoman
- aliquotSum
- View more