Fast Greatest Common Divisor (GCD) Algorithm

It is better to do this:

public static long LCM(long a, long b)
{
    return (a / GCD(a,b)) * b;
}

To avoid overflow on big numbers.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

About the Author

Mauro Leggieri

Web Developer

Argentina

Member

My name is Mauro Leggieri. I am 30 year-old, married and have a child.

I am a system engineer (UTN university) and am being programming for more than 20 years from the C64 to the PC and some microcontrollers.

Mostly of my time, I program games for Windows.

Soon, my site http://www.mauroleggieri.com.ar

Article Top

Poor

Excellent

Add a reason or comment to your vote: x
Votes of 3 or less require a comment

Alternative to Fast Greatest Common Divisor (GCD) Algorithm

It is better to do this:public static long LCM(long a, long b){ return (a / GCD(a,b)) * b;}To avoid overflow on big numbers.

Type	Tip/Trick
Licence	CPOL
First Posted	18 Feb 2011
Views	1,006
Bookmarked	1 time

C#JavaVisual-Studio
C#4.0VB.NET, +

		9,884,459 members (43,092 online) Visit CodeProject.TV Discuss CodeProject.TV Sign in Email Password Forgot your password? Sign in using

Fast Greatest Common Divisor (GCD) Algorithm

License

About the Author

Comments and Discussions