Saved Bookmarks
| 1. |
Use Euclid’s Division Algorithm to find the HCF of:(i) 135 and 225 |
|
Answer» What is Eulid division lemma HCF of 225 and 135 by using Euclid\'s Algorithm lemma:-225=135×1+90135=90×1+4590=45×1+0Since the divisor is 45 at the 3rd stage and the remainder is 0. Therefore the HCF of 135 and 225 is 45. |
|