Edstroyer

10-28-2004, 07:05 AM

this method is called " method of successive division"

example : find the Greatest Common Divisor (GCD) of the two numbers:

31 and 27 ... ofcourse, you can pick any other two numbers, its that easy!

notice the pattern because its the only way i can explain it:

START :

31 = (27)*1 + [4]

(27) = [4]*6 + {3}

[4] = {3}*1 + (1) <--- GCD = (1)

{3} = (1)*3 + 0 ----> STOP when you see the Zero , your GCD is the previous step

ofcourse the GCD is a 1 because 31 is a prime , but try two other numbers and see how quick and easy this method is.

might just save you on the actual exam :whistle:

example : find the Greatest Common Divisor (GCD) of the two numbers:

31 and 27 ... ofcourse, you can pick any other two numbers, its that easy!

notice the pattern because its the only way i can explain it:

START :

31 = (27)*1 + [4]

(27) = [4]*6 + {3}

[4] = {3}*1 + (1) <--- GCD = (1)

{3} = (1)*3 + 0 ----> STOP when you see the Zero , your GCD is the previous step

ofcourse the GCD is a 1 because 31 is a prime , but try two other numbers and see how quick and easy this method is.

might just save you on the actual exam :whistle: