Question

use Euclid's division algorithm to find hcf of 135and225​

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:

Step-by-step explanation:

225 > 135. Applying Euclid's Division algorithm we get

225=135\times 1+90

since remainder \neq 0 we again apply the algorithm

135=90\times 1+45

since remainder \neq 0 we again apply the algorithm

90=45\times 2

since remainder = 0 we conclude the HCF of 135 and 225 is 45.