extended_euclidean_algorithm

Extended Euclidean Algorithm.

Arguments

• a - First number.
• b - Second number.

Returns

• gcd - Greatest common divisor.
• x - First Bezout coefficient.
• y - Second Bezout coefficient.

Fully qualified path: alexandria_math::extended_euclidean_algorithm::extended_euclidean_algorithm

#![allow(unused)]
fn main() {
pub fn extended_euclidean_algorithm(a: u128, b: u128) -> (u128, u128, u128)
}