Top 8.2% forks on npmjs.org
npmjs.org : divisor
Calculates divisors/factors of natural numbers and gcd/lcm using euclid's algorithm.
Registry
-
Source
- Homepage
- JSON
- codemeta.json
purl: pkg:npm/divisor
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
License: MIT
Latest release: about 1 year ago
First release: almost 5 years ago
Dependent packages: 1
Dependent repositories: 3
Downloads: 33 last month
Stars: 2 on GitHub
Forks: 4 on GitHub
Total Commits: 64
Committers: 1
Average commits per author: 64.0
Development Distribution Score (DDS): 0.0
More commit stats: commits.ecosyste.ms
See more repository details: repos.ecosyste.ms
Last synced: 10 days ago