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