Math, asked by lovlyzarah, 9 months ago

use euclids division algorithm to find the hcf of 1020 and 255 pls as fast as possibb;e 66points if u knw thn answer pls

Answers

Answered by Anonymous
49

\bf\large\green{To\:Find:-}

  • H.C.F. of 1020 and 255 (Using Euclid's Division Algorithm)

\tt\pink{SoLUtIoN:-}

Given Numbers: 1020 and 225

  • Here, 1020>225.

☆So we will divide greater number by smaller number.

●Divide 1020 by 225

●The quotient is 4 and the remainder is 120

  • 1020 = 225 × 4 + 120

□Now,

●Divide 225 by 120

●The quotient is 1 and remainder is 105.

  • 225 = 120 × 1 + 105

□Again,

●Divide 120 by 105

●The quotient is 1 and remainder is 15

  • 120 = 105 × 1 + 15

□Again,

●Divide 105 by 15

●The quotient is 7 and remainder is 0

  • 105 = 15 × 7 + 0

=》\tt\red{Thus, \:HCF \:is\: 7 }

♧( By Euclids Division Algorithm)♧

Answered by rsultana331
10

Answer:

Divide 225 by 120

●The quotient is 1 and remainder is 105.

225 = 120 × 1 + 105

●Divide 120 by 105

●The quotient is 1 and remainder is 15

120 = 105 × 1 + 15

●Divide 105 by 15

●The quotient is 7 and remainder is 0

105 = 15 × 7 + 0

Similar questions