Question

Use Euclid’s division algorithm to find the HCF of

(i) 867 and 255. (ii) 196 and 38225​

Answer 1

Answer:

196 is the HCF of 196 and 38220.

Solution:

38220 is higher than the 196, such that the smallest number is taken as divisor and the largest number is taken as dividend.

Then by using the Euclid’s algorithm,

The finding of HCF of 196 and 38220 is solved in the below attachment.

The quotient for by dividing 38220 by 196 is 195. It has been exactly divisible by providing the remainder as 0.

196 is the Highest Common Factor of the numbers 196 and 38220 by using Euclid’s algorithm.

Step-by-step explanation:

By using EDL

a=bq+r

where a is > b

so a =867 and b=255

867=255×3+102

here r≠0 so a=255 and b=102

255=102×2+51

here r≠0 so a=102 and b=51

102=51×2+0

here r=0

so, Hcf of (867,255) is =51

I HOPE THIS WILL HELP YOU MARK AS BRAINLIEST

Answer 2

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=4

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.