Question

using Euclid division algorithm to hcf of 870 and 225

Answer 1

♤♤hey frnds......

_______________________________________⬇️⬇️⬇️⬇️

we know that, reminder theorem ....

Dividend = (divisor × quotient ) + Reminder

a> b

a = 867 , b= 255

hence a>b

then using Euclid division algorithms..

867 / 255

=> 867 = (255 × 3 ) + 102

then using algorithm ,

hence , a>b
255> 102

again ,
255/ 102

=> 255 =(102 ×2 ) + 51

hence , 102 > 51

then using algorithms ,

102/ 51

102 = (51 ×2 ) +0

HCF of 867 & 255 is 51 .......


I hope its helpful!!!!!