Greatest common divisor
From Lazarus wiki
Jump to navigationJump to searchThe greatest common divisor of two integers is the largest integer that divides them both.
There are many methods to calculate this. For example, the division-based Euclidean algorithm version may be programmed
function GreatestCommonDivisor( a, b: Int64 ): Int64;
var
temp : Int64;
begin
while b <> 0 do
begin
temp := b ;
b := a mod b ;
a := temp ;
end;
result := a;
end;