Highest Common Factor of 9879, 3988 using Euclid's algorithm
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 9879, 3988 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 9879, 3988 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 9879, 3988 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 9879, 3988 is 1.
HCF(9879, 3988) = 1
HCF of 9879, 3988 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 9879, 3988 is 1.
Highest Common Factor of 9879,3988 is 1
Step 1: Since 9879 > 3988, we apply the division lemma to 9879 and 3988, to get
9879 = 3988 x 2 + 1903
Step 2: Since the reminder 3988 ≠ 0, we apply division lemma to 1903 and 3988, to get
3988 = 1903 x 2 + 182
Step 3: We consider the new divisor 1903 and the new remainder 182, and apply the division lemma to get
1903 = 182 x 10 + 83
We consider the new divisor 182 and the new remainder 83,and apply the division lemma to get
182 = 83 x 2 + 16
We consider the new divisor 83 and the new remainder 16,and apply the division lemma to get
83 = 16 x 5 + 3
We consider the new divisor 16 and the new remainder 3,and apply the division lemma to get
16 = 3 x 5 + 1
We consider the new divisor 3 and the new remainder 1,and apply the division lemma to get
3 = 1 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 9879 and 3988 is 1
Notice that 1 = HCF(3,1) = HCF(16,3) = HCF(83,16) = HCF(182,83) = HCF(1903,182) = HCF(3988,1903) = HCF(9879,3988) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 9879, 3988 using Euclid's Algorithm
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 9879, 3988?
Answer: HCF of 9879, 3988 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 9879, 3988 using Euclid's Algorithm?
Answer: For arbitrary numbers 9879, 3988 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.