Question

Find lcm of 135 and 225 by Euclid division algorithm

Answer 1

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 :-


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


The representation is as follows :-


For any real number 'A' , there is always a unique number 'B' which satisfies the equation given by :-


A = Bq + r


Where,

Quotient is denoted by q and the remainder is denoted by r.


Now,
We know that :-

☸️ HCF * LCM = PRODUCT OF THE TWO NUMBERS.

so,
LCM = PRODUCT ÷HCF

So,

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



Thanks!

Answer 2

Answer:

This is the answer of LCM 135 and 225