- euc - euclidean algorithm
- euc_ext - extended euclidean algorithm
- lcm - least common multiple
- congruence - congruence soliving function, finding smallest x for solution
Program
use euc_lib;
fn main() {
prinln!("{}", euc_lib::I32::euc_ext(135, 35));
}Output
NWD = 5, S = -1, T = 4
Program
use euc_lib;
fn main() {
prinln!("{}", euc_lib::I32::euc(135, 35)); // there is recursive variant too: euc_recursive(135,35)
}Output
5
Program
use euc_lib;
fn main() {
println!("{:?}", euc_lib::I32::euc_from_vec(vec![21, 14, 56]));
}Output
Ok(7)
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
Program
use euc_lib;
fn main() {
println!("{:?}", euc_lib::I32::lcm_from_vec(vec![12,4,8]))
}Output
Ok(24)
Program
use euc_lib;
fn main() {
println!("{:?}", euc_lib::I32::congruence(9,21,30))
}Output
Ok(9)
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
NWD = 5, S = -1, T = 4