Greatest common divisor and least common multiple for two numbers

The greatest common divisor of two numbers (using the method of dividing the divide) and the least common multiple

Euclidean method:

1. First the remainder is obtained by using a small number in addition to the large number. number.

3. A third remainder is obtained with the second remainder, in addition to the first remainder.

This is followed by a successive number minus the previous remainder until the remainder is 0.

Program code:

#include <stdio.h>

int Main ()

{

int c = 0;

int a = +, B =-;

int ta = a, TB = b;

if (Ta > TB)

{

Ta = b;

TB = A;

}

c = Tb%ta;

while (c)

{

TB = TA;

Ta = c;

c = Tb%ta;

}

printf ( "greatest common divisor:%d\n" , TA);

printf ( "least common multiple:%d\n" , (a*b)/TA);

System ( "pause");

return 0;

}

Greatest common divisor and least common multiple for two numbers