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