find gcd of the following by euclid's algorithm 12576 and 4052
Answers
Answered by
4
gcd means greatest common factor so here we need to find hcf
by euclid"s division lemma,
12576=4052×3+420
4052=420×9+272
420=272×1+148
272=148×1+124
148=124×1+24
124=24×5+4
24=4×6+0
here the remainder is 0,
hence the required gcd is 4
by euclid"s division lemma,
12576=4052×3+420
4052=420×9+272
420=272×1+148
272=148×1+124
148=124×1+24
124=24×5+4
24=4×6+0
here the remainder is 0,
hence the required gcd is 4
hardikmahuwagara:
i have more question in this plzz solve it
Similar questions
Math,
8 months ago
Chemistry,
8 months ago
Accountancy,
1 year ago
Math,
1 year ago
Math,
1 year ago