hcf of 1109 and 4999 by euclids division lemma
Answers
Answered by
7
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
---------------------------------------
---------------------------------------
HOPE IT HELPZ...
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
---------------------------------------
---------------------------------------
HOPE IT HELPZ...
DiyanaN:
thanks
Answered by
4
Given
a=4999 b=1109
By EDL
a=bq+r 0less than or equal to r less than b
4999=1109×4+563
1109=563×1+546
563=546×1+17
546=17×32+2
17=2×8+1
2=1×2+0
therefore HCF=2
Similar questions