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