Greatest common divisor

Greatest common divisor

Postby Guest » Mon Jul 08, 2019 12:30 pm

What are advantages of using Euclid algorithm over prime decomposition to find the gcd of two numbers?
Should you use Euclid’s algorithm in some cases and prime decomposition in others?

Return to Number Theory

Who is online

Users browsing this forum: No registered users and 3 guests