# Thread: easy way of finding GCD !

1. Good post? |

## easy way of finding GCD !

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

2. Good post? |

## Re: easy way of finding GCD !

hi....
its nice of u!!!!

thanks!!!!!!

sabna

3. Good post? |

## Re: easy way of finding GCD !

thanks,

4. Good post? |
A really good method for finding GCD.

5. Good post? |
good work, never thought of it

6. Good post? |
This deserves a bump!

7. Good post? |
This kind of question is common on the GRE?

44 and 28

44 = (28)*1+[16]
28 = [16]*1+{12}
16 = {12}*1+(4)
12 = 4*3+0 ==> Answer 4. Is this right?

8. Good post? |

## Im not very

clear on this? Can someone explain?

9. Good post? |
let me do it another way a bit graphical

---> 1
-->----
28 |44
---> 28 1
--->----------
--->16 | 28
-------->16 1
-------->----------
-------->12 | 16
------------->12 3
------------->-------------
------------->4 | 12
----------------->12
----------------->--------
------------------>X
----------------->---------

So 4 is the GCF.

regards
jinics

10. Good post? |
is this better?

44,28

1 l 44
2 l 22
2 l 11 prime =ending

1 l 28
2 l 14
2 l 7 prime = ending

just an alternative