Question

Using Euclid's division algorithm to find the HCF of 4052 and 12576

Answer 1

Answer:

HCF =4

Step-by-step explanation:

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

Therefore HCF(GCD)=4

Answer 2

HEY !!

UR ANSWER ...

Since 12567 > 4052, we apply the division lemma to 12576 & 4052 , to get 12567 = 4052 × 3 + 420

Since the reminder 420 ≠ 0 , we apply the division lemma to 4052 &420, to get 4052 = 420 × 9 + 272

We consider the new devisor 420 and the new remainder 272 , and apply the division lemma to get

420 = 272 × 1 + 148

We consider the new devisor 272 and the new remainder 148 , apply the division lemma to get

272 = 148 × 1 + 124

We consider the new devisor 148 and the new remainder 124 ,and apply the division lemma to get

148 = 124 ×1 + 24

We consider the new devisor 124 and the new remainder 24 , and apply the division lemma to get

124 = 24 × 5 + 4

We consider the new devisor 24 and the new remainder 4 , and apply the division lemma to get

24 = 4 × 6 + 0

The remainder has now become zero, so our procedues stops . Since the divisor at this stage is 4 , the HCF of 12567 & 4052 is 4 .

HOPE IT MAY HELPS U...

MARK IT AS A BRAINLIST ANSWER....

#PIHU ♥♥

MOHAN ♥♥