Find gcd(21,300) using euclid's algorithm.
Answers
Answered by
6
a = bq + r where a,b are positive integers and q,r are whole numbers
GCD (21,300) :
300 = 21(14) + 6
21 = 14(1) + 7
14 = 7(2) + 0
As the remainder is zero,we can not proceed further.
So,the GCD of 21 and 300 is 7
GCD(21,300) = 7
GCD (21,300) :
300 = 21(14) + 6
21 = 14(1) + 7
14 = 7(2) + 0
As the remainder is zero,we can not proceed further.
So,the GCD of 21 and 300 is 7
GCD(21,300) = 7
Similar questions