Crate primefactor[][src]

Expand description

Module for factorizing integers

Structs

Functions

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

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

Test if the value is a prime number, or not

Calculate the Least common multiple (LCM) for 2 integers

Unsigned 128-bit integer square root calculation. Based on example implementation in C at: https://en.wikipedia.org/wiki/Integer_square_root