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