find gcd (1001,1331) using Euclidean algorithm.
Answers
Answered by
3
Step-by-step explanation:
1331=1001*1+330
1001=330*3+11
330=11*30+0
Therefore 11 is the greatest common divisor. Notice that each remainder has the gcd as a factor-which is the sole proof of the Euclidean algorithm. It will be the last factor before you arrive at 0.
Another method is to take the intersection of the prime factorization of each number.
1331=11^3 and 330=11*2*5
Since they only have 11 in common(the intersection) it is the gcd.
select a brain list
Similar questions