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