Algorithms: LCM and GCD

Least Common Multiple:

lcm(a,b) = abs(a*b) / gcd(a,b) = abs(a) / gcd(a,b) * abs(b)

Greatest common divisor:

gcd(a,b) = gcd(b, a%b);

Code:

  int gcd(int a, int b) {

    if (b == 0)
	  return a;

	return gcd(b, a%b);

  }
Advertisements
This entry was posted in Coding and tagged , , . Bookmark the permalink.

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