C Language seeking greatest common divisor and least common multiple

Seeking greatest common divisor and least common multiple

Assuming that there are two numbers a and B, the greatest common divisor and least common multiple of a B are actually a problem, and it is concluded that the greatest common divisor of these two numbers can calculate their least common multiple.

Least common multiple's formula is a*b/m.

M for greatest common divisor

Because A=m*i; B=m*j;

Least common multiple to m*i*j

Methods for calculating the greatest common divisor of A and B:

Method One:

More Phase loss subtraction:

The largest of the two numbers is subtracted from the smallest, until two is equal, this number is greatest common divisor

such as 4 and 6

6-4=2

2 numbers become 4 and 2.

4-2=2

Two numbers become 2 and 2.

2=2 that is 2 is two number of greatest common divisor

Method Two:

Euclidean method:

Approximate principle similar to more phase loss subtraction

A>b

The remainder of the a%b is R

C Language seeking greatest common divisor and least common multiple