euc_lib

Easy to use implementation of extended and normanl Euclidean algorithm

Want to contribute?:

My github:

Project:

Support:

Example usage:

Extended

Program

use euc_lib;
fn main() {
    prinln!("{:?}", euc_lib::I32::euc_ext(135, 35));
}

Output

EucRes { d: 5, s: -1, t: 4 }

Simple

Program

use euc_lib;
fn main() {
    prinln!("{}", euc_lib::I32::euc(135, 35)); // there is recursive variant too: euc_recursive(135,35)
}

Output

5

Vector as an argument

Program

use euc_lib;
fn main() {
    println!("{:?}", euc_lib::I32::euc_from_vec(vec![21, 14, 56]));
}

Output

Ok(7)

LCM

Simple

This version implements Least common multiple calculating method using gcd (Euclidean algorithm)

Program

use euc_lib;
fn main () {
    println!("{:?}", euc_lib::I32::lcm(21, 6)) // there is recursive variant too: lcm_recursive
}

Output

42

Vector as argument

Program

use euc_lib;
fn main() {
    println!("{:?}", euc_lib::I32::lcm_from_vec(vec![12,4,8]))
}

Output

Ok(24)

i64 support

To use i64 versions of all functions just use euc_lib::I64 instead of euc_lib::I32

Program

use euc_lib;
fn main() {
    prinln!("{:?}", euc_lib::I64::euc_ext(135, 35));
}

Output

EucRes { d: 5, s: -1, t: 4 }