Saved Bookmarks
| 1. |
by applying Euclid\'s division of lemma to find HCF of 650&1170 |
| Answer» The largest number which divides 650 and 1170 = HCF (650,1170)By Euclid’s division algorithm,1170 = 650 {tex}\\times{/tex} 1 + 520650 = 520 {tex}\\times{/tex} 1 + 130520 = 130 {tex}\\times{/tex} 4 + 0So, HCF = 130So 130 is the largest number which divides 650 and 1170 | |