Saved Bookmarks
| 1. |
1. Use Euclid's division algorithm to find the HCFp () f35 and 225 196 and 38220 |
|
Answer» (i) 135 and 225Since 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.(ii) 196 and 38220Since 38220 > 196, we apply the division lemma to 38220 and 196 to obtain38220 = 196 × 195 + 0Since the remainder is zero, the process stops.Since the divisor at this stage is 196,Therefore, HCF of 196 and 38220 is 196.please like the solution 👍 ✔️👍 |
|