Created By : Jatin Gogia
Reviewed By : Rajasekhar Valipishetty
Last Updated : Apr 06, 2023
HCF Calculator using the Euclid Division Algorithm helps you to find the Highest common factor (HCF) easily for 9843, 8458, 25061 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 9843, 8458, 25061 is 1 the largest number which exactly divides all the numbers i.e. where the remainder is zero. Let us get into the working of this example.
Consider we have numbers 9843, 8458, 25061 and we need to find the HCF of these numbers. To do so, we need to choose the largest integer first and then as per Euclid's Division Lemma a = bq + r where 0 ≤ r ≤ b
Highest common factor (HCF) of 9843, 8458, 25061 is 1.
HCF(9843, 8458, 25061) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 9843, 8458, 25061 is 1.
Step 1: Since 9843 > 8458, we apply the division lemma to 9843 and 8458, to get
9843 = 8458 x 1 + 1385
Step 2: Since the reminder 8458 ≠ 0, we apply division lemma to 1385 and 8458, to get
8458 = 1385 x 6 + 148
Step 3: We consider the new divisor 1385 and the new remainder 148, and apply the division lemma to get
1385 = 148 x 9 + 53
We consider the new divisor 148 and the new remainder 53,and apply the division lemma to get
148 = 53 x 2 + 42
We consider the new divisor 53 and the new remainder 42,and apply the division lemma to get
53 = 42 x 1 + 11
We consider the new divisor 42 and the new remainder 11,and apply the division lemma to get
42 = 11 x 3 + 9
We consider the new divisor 11 and the new remainder 9,and apply the division lemma to get
11 = 9 x 1 + 2
We consider the new divisor 9 and the new remainder 2,and apply the division lemma to get
9 = 2 x 4 + 1
We consider the new divisor 2 and the new remainder 1,and apply the division lemma to get
2 = 1 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 9843 and 8458 is 1
Notice that 1 = HCF(2,1) = HCF(9,2) = HCF(11,9) = HCF(42,11) = HCF(53,42) = HCF(148,53) = HCF(1385,148) = HCF(8458,1385) = HCF(9843,8458) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 25061 > 1, we apply the division lemma to 25061 and 1, to get
25061 = 1 x 25061 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 1 and 25061 is 1
Notice that 1 = HCF(25061,1) .
Here are some samples of HCF using Euclid's Algorithm calculations.
1. What is the Euclid division algorithm?
Answer: Euclid's Division Algorithm is a technique to compute the Highest Common Factor (HCF) of given positive integers.
2. what is the HCF of 9843, 8458, 25061?
Answer: HCF of 9843, 8458, 25061 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 9843, 8458, 25061 using Euclid's Algorithm?
Answer: For arbitrary numbers 9843, 8458, 25061 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.