Perform the greatest common divisor between two integers and the solutions of the Bezout's identity (Extended Euclidian algorithm).
[g,u,v] = NARVAL_S_ExtGcd(a,b)
integer.
integer.
greatest common divisor.
Bezout first factor.
Bezout second factor.
NARVAL_S_ExtGcd performs the greatest common divisor (GCD) g of the two integers a and b in respect with the Extended Euclidian algorithm (WIKIPEDIA). It also finds the integers u and v (one of which is typically negative) that satisfy the Bézout's identity au+bv=g.
Dr. Foued Melakessou
Research Associate
Interdisciplinary Centre for Security, Reliability and Trust
Room F106
University of Luxembourg
6, rue Coudenhove Kalergi
L-1359 Luxembourg-Kirchberg
E-mail: foued.melakessou@uni.lu
Tel: (+352) 46 66 44 5346