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