Function primefactor::u128_gcd

pub fn u128_gcd(this: u128, that: u128) -> u128

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