Search results
30 packages found
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
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
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
Simple tool to return the LCM of any two given integers.
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
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
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
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
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
C's and C++'s math functions in TypeScript & JavaScript
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
Scientific Calculator
- Maths
- Addition
- Subtraction
- Multiplication
- Division
- Arithmetic
- Exponentiation
- Modulus
- Square Root
- Absolute Value
- Factorial
- GCD
- LCM
- Bitwise
- View more
LittleCMS in JS with WASM
Some common functions for modular arithmetic using native JS implementation of BigInt
This package is a combination of many useful functions.
- solverjs
- solver
- jssolver
- jssolution
- solverjavascript
- solverinjs
- solverjsfirst
- info
- maths
- getFib
- getGcd
- printFib
- sumAllDigit
- reverseNumber
- View more
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 JavaScript library that provides a bunch of useful, optimized and often math-related functions
lcm-requester is a wrapper on request module with validation on top of format and rules used
Computes the least common multiple of the given integers.
compute the least common multiple using Euclidean algorithm