[psyb0rg]

anyone know a way to find the LCM (Least Comman Factor) of two numbers?

[bla!!]

Take a look at Euclidian's algorithm for this.

LCM = (n1 * n2) \ GCD(n1, n2)


I'm sniffin a homework assignment, so that's as far as I'm gonna go.

[Mohan Giri]

LCM = (n1 * n2) \ GCD(n1, n2)

In this expression n1*n2 ok. What will do " \ GCD(n1,n2)". What is mean by GCD ????????

[psyb0rg]

shouldn't it be in the form of numerators and denominators? and yes, what is GCD?

[bla!!]

GCD is the greatest common divisor.

[Mohan Giri]

How to determine GCD?????

[bla!!]

This should be something that you can think about for a while and derive.

But I guess you guys want all the answers, here's the full code for deriving the least common multiple.

int GCD(int a, int b)
{
    int r;

    while(b)
        {
        r = a % b;
        a = b;
        b = r;
        }

    return(a);
}

int LCM(int a, int b)
{
    return a * b / GCD(a, b);
}

[psyb0rg]

Thanks a million!