Question

Use Euclid's algorithm to find the HCF of 4052 and 12576.
​

Answer 1

Answer:

hajdbhdisjsjsj

Step-by-step explanation:

mark me brainliest

Answer 2

Step-by-step explanation:

since 12576 > 4052 , we apply the division lemma to 12576 and 4052 to get

12576 = 4052 x 3 +420

since the remainder 420 is not equal 0 , we apply division lemma to 4052 and 420 to get

420 =272 x 1 +124

we consider the new divisor 148 and New remainder 124 and apply the division to lemma

148 = 124 x 1 +24

we consider the new divisor 124 and new remainder 24 and apply the divisor lemma get

124 = 24 x 5 +4

we consider the new divisor 24 and new remainder 4 apply division lemma get

24 =4 x 6 +0

The remainder has now became 0 so, procedure stops since divisior in 4 stage of Hcf 12576 and 4052 is 4

Euclid division algorithm is not only use to calculate HCF