Search results
9 packages found
Sort by: Default
- Default
- Most downloaded this week
- Most downloaded this month
- Most dependents
- Recently published
compute the greatest common divisor using euclid's algorithm
published version 0.0.1, 11 years ago13 dependents licensed under $MIT
172,938
Computes the greatest common divisor
published version 1.0.0, 10 years ago2 dependents licensed under $MIT
67
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
published version 1.0.11, 9 months ago0 dependents licensed under $MIT
53
Calculates the greatest common divisor of two integers.
published version 0.1.0, 7 years ago4 dependents licensed under $MIT
19
Compute the greatest common divisor using Iterative implementation.
published version 1.0.1, 8 years ago0 dependents licensed under $MIT
12
Number games
published version 1.6.8, 5 years ago0 dependents licensed under $ISC
10
Do math on arrays: find divisors or factors of a number, sum or multiply an array, and much more!
published version 1.1.3, 10 years ago0 dependents
8
Efficient calculation of divisors (also called factors) of small natural numbers
published version 1.0.1, 5 years ago0 dependents licensed under $MIT
7
Este paquete aporta el mecanismo para hallar el máximo común divisor de números Naturales.
published version 1.0.0, 2 years ago0 dependents licensed under $ISC
4