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 7129, 4952 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 7129, 4952 is 1 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 7129, 4952 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 7129, 4952 is 1.
HCF(7129, 4952) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 7129, 4952 is 1.
Step 1: Since 7129 > 4952, we apply the division lemma to 7129 and 4952, to get
7129 = 4952 x 1 + 2177
Step 2: Since the reminder 4952 ≠ 0, we apply division lemma to 2177 and 4952, to get
4952 = 2177 x 2 + 598
Step 3: We consider the new divisor 2177 and the new remainder 598, and apply the division lemma to get
2177 = 598 x 3 + 383
We consider the new divisor 598 and the new remainder 383,and apply the division lemma to get
598 = 383 x 1 + 215
We consider the new divisor 383 and the new remainder 215,and apply the division lemma to get
383 = 215 x 1 + 168
We consider the new divisor 215 and the new remainder 168,and apply the division lemma to get
215 = 168 x 1 + 47
We consider the new divisor 168 and the new remainder 47,and apply the division lemma to get
168 = 47 x 3 + 27
We consider the new divisor 47 and the new remainder 27,and apply the division lemma to get
47 = 27 x 1 + 20
We consider the new divisor 27 and the new remainder 20,and apply the division lemma to get
27 = 20 x 1 + 7
We consider the new divisor 20 and the new remainder 7,and apply the division lemma to get
20 = 7 x 2 + 6
We consider the new divisor 7 and the new remainder 6,and apply the division lemma to get
7 = 6 x 1 + 1
We consider the new divisor 6 and the new remainder 1,and apply the division lemma to get
6 = 1 x 6 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 7129 and 4952 is 1
Notice that 1 = HCF(6,1) = HCF(7,6) = HCF(20,7) = HCF(27,20) = HCF(47,27) = HCF(168,47) = HCF(215,168) = HCF(383,215) = HCF(598,383) = HCF(2177,598) = HCF(4952,2177) = HCF(7129,4952) .
Here are some samples of HCF using Euclid's Algorithm calculations.
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 7129, 4952?
Answer: HCF of 7129, 4952 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 7129, 4952 using Euclid's Algorithm?
Answer: For arbitrary numbers 7129, 4952 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.