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 9838, 1971 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 9838, 1971 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 9838, 1971 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 9838, 1971 is 1.
HCF(9838, 1971) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 9838, 1971 is 1.
Step 1: Since 9838 > 1971, we apply the division lemma to 9838 and 1971, to get
9838 = 1971 x 4 + 1954
Step 2: Since the reminder 1971 ≠ 0, we apply division lemma to 1954 and 1971, to get
1971 = 1954 x 1 + 17
Step 3: We consider the new divisor 1954 and the new remainder 17, and apply the division lemma to get
1954 = 17 x 114 + 16
We consider the new divisor 17 and the new remainder 16,and apply the division lemma to get
17 = 16 x 1 + 1
We consider the new divisor 16 and the new remainder 1,and apply the division lemma to get
16 = 1 x 16 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 9838 and 1971 is 1
Notice that 1 = HCF(16,1) = HCF(17,16) = HCF(1954,17) = HCF(1971,1954) = HCF(9838,1971) .
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 9838, 1971?
Answer: HCF of 9838, 1971 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 9838, 1971 using Euclid's Algorithm?
Answer: For arbitrary numbers 9838, 1971 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.