At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
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 !
@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.
i wrote up euclids algorithm once
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
if R = 0, then the gcd is the previous R
Now look : |dw:1062636136311:dw|
@amistre64 could you please be more specific? I feel quite confused, however, your method seems to be more suitable for my condition
@SerikMB : It s an interesting way !
Now we have 84/32 Answer to it!
@E.ali actually i think the GCD for 84 and 32 is 4
OK ! Thank you ! But we want just it :|dw:1062637723502:dw|
sorry, but i still can't get in ur method with boxes
OK friend ! It s is that 84/32 we have :|dw:1062637919084:dw|
ive got to run to class for an hour :)
@amistre64 cool job BTW )) thank u!))
@E.ali what's next, we got 84, 32, 20 and 2
wow that is cool
i had to fix a few slight bugs. As is it has to go thru at least 1 cycle. I added some lines to fix it: if A == B, then gcd = A (the gcd of a number with itself is itself) if g==0 in the end, then the gcd is the smaller of the numbers. 12 = 6(2) + 0 has only one cycle