Saved Bookmarks
| 1. |
What is euclid Algorithum and division??? |
| Answer» Consider we have two numbers 78 and 980 and we need to find the HCF of both of these numbers. To do this, we choose the largest integer first, i.e. 980 and then according to Euclid Division Lemma, a = bq + r where 0 ≤ r ≤ b;980 = 78 × 12 + 44Now, here a = 980, b = 78, q = 12 and r = 44.Now consider the divisor as 78 and the remainder 44 and apply the Euclid division method again, we get78 = 44 × 1 + 34Similarly, consider the divisor as 44 and the remainder 34 and apply the Euclid division method again, we get44 = 34 × 1 + 10Following the same procedure again,34 = 10 × 3 + 410=4×2+24=2×2+0As we see that the remainder has become zero, therefore, proceeding further is not possible and hence the HCF is the divisor b left in the last step which in this case is 2. We can say that the HCF of 980 and 78 is 2. | |