Saved Bookmarks
| 1. |
Use euclid division algorithm to find the HCF of 135 and 225 |
| Answer» Here 225 > 135 we always divide greater number with smaller one.Divide 225 by 135 we get 1 quotient and 90 as remainder so that225= 135× 1 + 90Divide 135 by 90 we get 1 quotient and 45 as remainder so that135= 90× 1 + 45Divide 90 by 45 we get 2 quotient and no remainder so we can write it as90 = 2× 45+ 0As there are no remainder so deviser 45 is our HCF | |