Question

find HCF by euclids algorithm 12575, 4056​

Answer 1

Answer:

12575>4056 by euclid division alogrinthm 12575=4056*3 +420 4056=420*9+272 420=272*1+148 272=148*1+124 148=124*1+24 124=24*5+4 24=4*6+0 as the process stops . so our HCF is 4 ☺

Step-by-step explanation:

❤❤

Answer 2

Answer:

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

Step 1: Since 12576 > 4052, apply the division lemma to 12576 and 4052, to get.

Step 2: Since the remainder 420 ≠ 0, apply the division lemma to 4052 and 420, to get.

Step 3: Consider the new divisor 420 and the new remainder 272, and apply the division lemma to get.