Saved Bookmarks
| 1. |
than what it Was berore. Find he hune9. Using Euclid's division algorithm, find the HCF of 2160 and 3520fnd the value ofm |
|
Answer» Euclid's division algorithm: According to this the HCF of any two positive integers a and b, with a>b a= bq+r, 0 ≤ra= 3520 , b= 2160 On applying euclid's division Lemma for 2160 & 3520 3520 = (2160×1)+1360 Here, remainder= 1360≠0So take new Dividend as 2160 & divisior as 13602160 = (1360×1)+800Here, remainder= 800≠0So take new Dividend as 1360 & divisior as 8001360= (800×1)+560Here, remainder= 560≠0So take new Dividend as 800 & divisior as 560800 = (560×1)+240 Here, remainder= 240≠0So take new Dividend as 560 & divisior as 240560 = (240×2)+80 Here, remainder= 80≠0So take new Dividend as 240 & divisior as 80240 = (80×3)+0Here, the remainder is 0 & last divisor is 80. Hence , HCF of 2160 & 3520 is 80 |
|