Question

I need to do a presentation on algorithms and I can't think of a good algorithm. Will fan and medal. Thanks! :)

Answer 1

eulers algorithm for finding the GCD of 2 numbers is fairly interesting and used as a fundamental concept in number theory i believe

Answer 2

Do you know any simple algorithms? @amistre64

Answer 3

GCD is a simple algorithm

Answer 4

ok

Answer 5

given 2 number a,b such that a>b

a= bn + r1 for some integer n

b = r1n + r2

r1 = r2n + r3

....

when rk = 0, then the GCD is r{k-1}
-------------------------

try 12 and 28

28 = 12(2) + 4
12 = 4(3) + 0

4 is the GCD of 12 and 18

Answer 6

the GCD of 12 and 28 that is

Answer 7

thanks! :)