Crate primefactor

Module for factorizing integers

Modules

candidates

Implementations of Prime wheels for number factorization https://en.wikipedia.org/wiki/Wheel_factorization

Structs

IntFactor

PrimeFactors

Functions

primefactor_gcd

Calculate the Greatest common divisor (GCD) between 2 unsigned integers

u128_gcd

Calculate the Greatest common divisor (GCD) between 2 unsigned integers. Based on Euclid’s algorithm pseudo code at: https://en.wikipedia.org/wiki/Euclidean_algorithm

u128_is_prime

Test if the value is a prime number, or not

u128_lcm

Calculate the Least common multiple (LCM) for 2 integers