Saved Bookmarks
| 1. |
Use Euclids division algorithm to find HCF 135and225 |
|
Answer» 135 and 225 Since 225 > 135,we apply the division lemma to 225 and 135 to obtain225 = 135 × 1 + 90Since remainder 90 ≠ 0, we apply the division lemma to 135 and 90 to obtain135 = 90 × 1 + 45We consider the new divisor 90 and new remainder 45, and apply the division lemma to obtain90 = 2 × 45 + 0Since the remainder is zero, the process stops.Since the divisor at this stage is 45,Therefore, the HCF of 135 and 225 is 45. 45 45 |
|