Perform the greatest common divisor between two integers (Iterative Euclidian algorithm).
[g] = NARVAL_S_GcdIter(a,b)
integer.
integer.
greatest common divisor.
NARVAL_S_GcdIter performs the greatest common divisor (GCD) g of the two integers a and b in respect with the Iterative Euclidian algorithm (WIKIPEDIA).
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