48 packages found
Description
Convert number to fraction
Keywords
Publisher
Description
Computes the greatest common divisor (gcd).
Keywords
- 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
Publisher
Description
Computes the least common multiple (lcm).
Keywords
- 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
Publisher
Description
Fast and simple gcd/lcm implementation
Keywords
Publisher
Description
Use this package for simple computation purpose
Keywords
Publisher
Description
Common typescript ready prototypes available in both es5 and es6
Keywords
- server-side
- client-side
- common
- typescript
- prototype
- array
- all
- any
- append
- average
- chunk
- clone
- compact
- contains
- View more
Publisher
Description
Integers for JavaScript
Keywords
- abitrary
- addition
- algorithm
- arithmetic
- big
- big-int
- big-integer
- big-integers
- big-num
- big-number
- big-numbers
- bigint
- biginteger
- bigintegers
- View more
Publisher
Description
Some common functions for modular arithmetic using native JS implementation of BigInt
Keywords
Publisher
Description
compute the greatest common divisor using euclid's algorithm
Keywords
Publisher
Description
There are 5 games: brain-even, brain-calc, brain-gcd, brain-progression, brain-prime
Keywords
Publisher
Description
Compute the greatest common divisor using Iterative implementation.
Keywords
Publisher
Description
convert to popular formats
Keywords
Publisher
Description
Calculates divisors/factors of natural numbers and gcd/lcm using euclid's algorithm.
Keywords
- 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
Publisher
Description
Mathematics is the classification and study of all possible patterns.
Keywords
Publisher
Description
glsl implementation of the Euclid's algorithm for the calculation of the greatest common divisor.
Keywords
Publisher
Description
Finds greatest common divisor of numbers.
Keywords
Publisher
Description
Finds greatest common divisor of numbers.
Keywords
Publisher
Description
Mathematics is the classification and study of all possible patterns.
Keywords
Publisher
Description
This package contain os different cli games. Check if number is even. Provide a calculation result. Find GCD of 2 numbers. Find missed number in progression. Check if number is prime
Keywords
Publisher
Description
games of the brains