Get Answers to all your Questions

header-bg qa

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

Answers (1)

best_answer

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

Sayak

View full answer