Define Euclid's division lemma, HCE, LCM & fundamental theorem of Arithmetic's.
Answers
Answer:
Please mark as Brainliest
Step-by-step explanation:
Consider two numbers 78 and 980 and we need to find the HCF 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 + 44
Now, here a = 980, b = 78, q = 12 and r = 44.
Now consider the divisor 78 and the remainder 44, apply Euclid division lemma again.
78 = 44 × 1 + 34
Similarly, consider the divisor 44 and the remainder 34, apply Euclid division lemma to 44 and 34.
44 = 34 × 1 + 10
Following the same procedure again,
34 = 10 × 3 + 4
10 = 4 × 2 + 2
4 = 2 × 2 + 0
As we see that the remainder has become zero, therefore, proceeding further is not possible. Hence, the HCF is the divisor b left in the last step. We can conclude that the HCF of 980 and 78 is 2.
Let us try another example to find the HCF of two numbers 250 and 75. Here, the larger the integer is 250, therefore, by applying Euclid Division Lemma a = bq + r where 0 ≤ r < b, we have
a = 250 and b = 75
⇒ 250 = 75 × 3 + 25
By applying the Euclid’s Division Algorithm to 75 and 25, we have:
75 = 25 × 3 + 0
As the remainder becomes zero, we cannot proceed further. According to the algorithm, in this case, the divisor is 25. Hence, the HCF of 250 and 75 is 25.