5. Use Euclid’s algorithm to find

gcd(1001, 1331)

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.

-blinkwilliams-ga