Question

Use Euclid’s division algorithm to find the HCF of: (i) 135 and 225

Answer 1

Step-by-step explanation:

HCF (225,135) = 45. Process used is the Euclid's Division Algorithm.

Please refer the above photograph for the used process. ...

Euclid's Division Algorithm states that the divided is equal to product of the divisor and quotient added to the remainder. ...

A = Bq + r. ...

LCM = (225 * 135) / 45 = 5 *135 = 675.