Get Answers to all your Questions

header-bg qa

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

Answers (1)

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.

Posted by

lovekush

View full answer