HELP! URGENT! Need simple formula for "greatest common divisor" for only 2 numbers (integers)

Question

anonymous · Answer

Ok !
For example 32 & 84
First write :
84=X^y
32=X^y
Means it :
32 = 2^5
84=2^4 . 3
Now get the smallest :
It s 2^4
Then greatest common divisor = 2^4 = 16
Understand ?!:)
:D
It has another way too !

anonymous · Answer

@E.ali, thank you) could you please show me other ways? I'm currently working on programming, so it would be great if there were a particular formula.

amistre64 · Answer

i wrote up euclids algorithm once

amistre64 · Answer

L/S = Q.xxxx
       -Q
        -------
         0.xxxx
times S
        --------
         R

L = S, S=R, repeat

have to recall how i determined a break in the loop tho

amistre64 · Answer

if R = 0, then the gcd is the previous R

anonymous · Answer

Now look :
|dw:1062636136311:dw|

anonymous · Answer

@amistre64  could you please be more specific? I feel quite confused, however, your method seems to be more suitable for my condition

anonymous · Answer

@SerikMB :
It s an interesting way !

anonymous · Answer

Now we have 84/32
Answer to it!

anonymous · Answer

2.625

anonymous · Answer

what's next?

amistre64 · Answer

im hammering out some javascripting at the moment ... debugging

anonymous · Answer

@E.ali  actually i think the GCD for 84 and 32 is 4

anonymous · Answer

OK !
Thank you !
But we want just it :|dw:1062637723502:dw|

anonymous · Answer

Understand ?!

anonymous · Answer

sorry, but i still can't get in ur method with boxes

anonymous · Answer

OK friend !
It s is that 84/32 we have :|dw:1062637919084:dw|