Google Answers Logo
View Question
Q: Discrete Mathematics ( Answered,   0 Comments )
Subject: Discrete Mathematics
Category: Computers
Asked by: math01-ga
List Price: $2.00
Posted: 17 Nov 2002 10:30 PST
Expires: 17 Dec 2002 10:30 PST
Question ID: 109389
5. Use Euclid’s algorithm to find

gcd(1001, 1331)
Subject: Re: Discrete Mathematics
Answered By: blinkwilliams-ga on 17 Nov 2002 12:35 PST
Hi and thanks for the question!

Euclid's algorithm states:

For gcd(a,b)

If b is divisible by a then gcd(a, b) = b. 
If a = bt + r, for integers t and r, then gcd(a, b) = gcd(b, r). 

So for gcd(1001,1331)

1331 = 1001*1 + 330  so gcd(1001,1331)=gcd(1001,330)
1001 = 330*3 + 11    so gcd(1001,330)=gcd(330,11)
330 = 11*30  so gcd(330,11)=11

Therefore, gcd(1001,1331)=11

Hope that helps.  Please ask for clarification if needed.

There are no comments at this time.

Important Disclaimer: Answers and comments provided on Google Answers are general information, and are not intended to substitute for informed professional medical, psychiatric, psychological, tax, legal, investment, accounting, or other professional advice. Google does not endorse, and expressly disclaims liability for any product, manufacturer, distributor, service or service provider mentioned or any opinion expressed in answers or comments. Please read carefully the Google Answers Terms of Service.

If you feel that you have found inappropriate content, please let us know by emailing us at with the question ID listed above. Thank you.
Search Google Answers for
Google Answers  

Google Home - Answers FAQ - Terms of Service - Privacy Policy