Saved Bookmarks
| 1. |
By Euclid's division algorithm find 305,793 |
|
Answer» Answer: Since 793>305, we apply the DIVISION lemma to 793 and 305 to obtain: 793=305×2+183 Since REMAINDER 183
=0, we apply the division lemma to 305 and 183 to obtain: 305=183×1+122 We consider the NEW divisor 183 and new remainder 122, and apply the division lemma to obtain 183=122×1+61 Now, the new divisor is 122 and new remainder is 61, and apply the division lemma to obtain 122=61×2+0 Since the remainder is zero, the process stops. Also, the divisor at this stage is 61, HENCE, the HCF of 793 and 305 is 61. |
|