using euclids algorithm to find the HCF of 4052 and 12576
Answers
Answered by
0
Heya !!!
As 12576 > 4052, we would find their HCF by Euclid's Division Lemma, i.e.
a = bq + r, where 0 ≤ r < b
So,
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
So, the division stops here and as 4 is the divisor,
We get,
HCF (4052, 12576) = 4
Thanks!!!
As 12576 > 4052, we would find their HCF by Euclid's Division Lemma, i.e.
a = bq + r, where 0 ≤ r < b
So,
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
So, the division stops here and as 4 is the divisor,
We get,
HCF (4052, 12576) = 4
Thanks!!!
Similar questions
English,
8 months ago
Economy,
8 months ago
Science,
8 months ago
Social Sciences,
1 year ago
English,
1 year ago