Hcf of 25 and 75 by euclid division lemma
Answers
Answered by
0
Solution:
**********************************
Euclid's Division Lemma :
Given positive integers a and b ,
there exist unique pair of integers
q and r satisfying
a = bq+r , 0 ≤ r < b
*************************************
Here ,
75 > 25
When 75 is divided by 25 , the
remainder is 0 .
75 = 25 × 3 + 0
Notice that the remainder has
become zero , and we cannot
proceed any further .
We clime that the HCF ( 25 , 75 ) is
the divisor 3
Therefore ,
HCF( 25, 75 ) = 3
••••
**********************************
Euclid's Division Lemma :
Given positive integers a and b ,
there exist unique pair of integers
q and r satisfying
a = bq+r , 0 ≤ r < b
*************************************
Here ,
75 > 25
When 75 is divided by 25 , the
remainder is 0 .
75 = 25 × 3 + 0
Notice that the remainder has
become zero , and we cannot
proceed any further .
We clime that the HCF ( 25 , 75 ) is
the divisor 3
Therefore ,
HCF( 25, 75 ) = 3
••••
Similar questions