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