Question

Use Euclid,s division algorithm to find the HCF of 1109 and for 4999​

Answer 1

Answer:

here ur answer

Step-by-step explanation:

Here ,4999>1109

Now apply EDL(Eclid's Division Lemma) to 4999 & 1109

4999=4*1109 +563

Since the reminder is not zero ,apply edl to 1109 & 563

1109=1*563 +546

Here also the reminder is not zero ,thus apply edl to 563 & 546

563=1*546 +17

Here also remider is not zero thus apply edl to 546 & 17

546=32*17 + 2

Here also remider is not zero thus ,aplly edl to 17 & 2

17=8*2 +1

Here also the remider is not equal to zero thus ,apply edl to 2 & 1

2=2*1 +0

The reminder has now become zero ,so our procedure stops.The divisor in this stage is "1". Which implies that the HCF of 4999 & 1109 is 1.

We write HCF(4999,1109)=1

Answer 2

Answer:

4

Step-by-step explanation:

• please mark me the brain list