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