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