prime_factorization
A fast and efficient Elixir library for prime factorization of integers.
Algorithms and Data structures
Package Resources
Stars
1
Unreleased Activity
Unknown
First Release
10
months agoLast Release
10
months agoDownloads
42
last 90 daysLast Stable Version
1.1.0
Version 1.1.0
Elixir Version Requirement ~> 1.14
Documentation for 1.1.0
Dependencies
2
lehmer_gcd
~> 1.0
An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.
Community
Looks like this space is still empty… Want to be the first to contribute?
Share an article, talk, or podcast by adding resources to this package.