KoalaGurl1
  • KoalaGurl1
I need to do a presentation on algorithms and I can't think of a good algorithm. Will fan and medal. Thanks! :)
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
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.
katieb
  • katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
amistre64
  • amistre64
eulers algorithm for finding the GCD of 2 numbers is fairly interesting and used as a fundamental concept in number theory i believe
KoalaGurl1
  • KoalaGurl1
Do you know any simple algorithms? @amistre64
amistre64
  • amistre64
GCD is a simple algorithm

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

KoalaGurl1
  • KoalaGurl1
ok
amistre64
  • amistre64
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
amistre64
  • amistre64
the GCD of 12 and 28 that is
KoalaGurl1
  • KoalaGurl1
thanks! :)

Looking for something else?

Not the answer you are looking for? Search for more explanations.