Use Euclid's division algorithm to find the HCF of
1. 135 and 225.
2. 196 and 38220
Answers
⠀⠀⠀
Use Euclid's division algorithm to find the HCF of
1. 135 and 225.
2. 196 and 38220
━━━━━━━━━━━━━━━━━━━━━━━━━
⠀⠀⠀⠀⠀⠀
HCF of 225 and 135 is 45.
and,
HCF of 38220 and 196 is 195
━━━━━━━━━━━━━━━━━━━━━━━━━
⠀⠀⠀
1]. (225 ,135)
Here, 225 > 135
so, we will divide greater number by smaller .
Divide 225 by 135.
By Euclid Division lemma.
⠀⠀⠀
➩⠀⠀⠀⠀⠀225 = 135 × 1 + 90
➩⠀⠀⠀⠀⠀135 = 90 × 1 + 45
➩⠀⠀⠀⠀⠀90 = 2 × 45 + 0
Since remainder becomes 0 so,
➥HCF of 225 and 135 is 45.
━━━━━━━━━━━━━━━━━━━━━━━━━
2](196,38220)
Here 38220 > 196
so, we will divide 38220 by 196.
By Euclid Division lemma,
➩⠀⠀⠀⠀⠀38220 = 196 × 195 +0
Since remainder becomes 0 so,
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
➥HCF of 38220 and 196 is 195.
━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
Answer:
make me as brainliest and thank me if the answer is useful.
Step-by-step explanation:
By Euclid's division lemma,
225=135×1+90
r=90
135=90×1+45
r=45
90=45×2+0
So, H.C.F of 135 and 225 is 45
(ii) By Euclid's division lemma,
38220=196×195+0r=0
So, H.C.F of 38220 and 196 is 196
(iii) By Euclid's division lemma,
867=255×3+102
r=10
255=102×2+51
r=51
102=51×2+0
So, H.C.F of 867 and 255 is 51
The highest HCF among the three is 196.