Greatest Common Divisor and Least Common Multiple in Java


Least Common Multiple

private static int lcm(final int a, final int b) {
    return ((a * b) / gcd(a, b));
}

Greatest Common Divisor

private static int gcd(final int a, final int b) {
    if (b == 0) {
        return a;
    } else {
        return gcd(b, a % b);
    }
}
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s