Question

using euclids algorithm find hcf of 4052 and 12576

Answer 1

Dear student

Given integers are 4052 and 12576.

Here 12576 > 4052. Applying Euclid’s division lemma to 12576 and 4052, we get

12576 = 4052 × 3 + 420

Since the remainder, 420 ≠ 0. So we apply Euclid division lemma to 4052 and 420, we get

4052 = 420 × 9 + 272

Again applying Euclid division lemma to 420 and 272, we get

420 = 272 × 1 + 148

Again apply Euclid division lemma to 272 and 148, we get

272 = 148 × 1 + 124

Again apply Euclid division lemma to 148 and 124, we get

148 = 124 × 1 + 24

Again applying Euclid division lemma to 124 and 24, we get

124 = 24 × 5 + 4

Again applying Euclid division lemma to 24 and 4, we get

24 = 4 × 6 + 0

Since remainder = 0

∴ The divisor, 4 is the HCF of 4052 and 12576.
Regards