Saved Bookmarks
| 1. |
g。τ fHIVY牙计ftoT f fan, 1Write Euclid's division algorithm.140村3427NTExpress number as a product of its prime factor 140.1배Use Euclid's division algorithm find HCF of 135 and 22512, 15 3 21弧yHH HHTqaf πα喻fan, ı |
|
Answer» Euclid’s division Lemma Given positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 ≤ r < b. 2. 140=2*7070=2*3535=7*5Therefore 140=2*2*5*7 3. 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. Like my answer if you find it useful! |
|