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