Least common multiple in C programming?

Answer 1

The following code for example is a solution (you could do it with less variables, but this is more readable):
int GCD(int a, int b){
int n, k, c;
n = (a>b)?a:b;
k = (a>b)?b:a;
while (k){
c = n%k;
n=k;
k=c;
}
return n;
}