% Find greatest common divisor using Euclid's algorithm
% Usage: gcd(num1, num2, X) as in gcd(40,30,X)
gcd(U,0,U).
gcd(U,V,W) :- (V=\=0), Temp is U mod V, gcd(V,Temp,W), !.