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 5352, 7250, 56788 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 5352, 7250, 56788 is 2 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 5352, 7250, 56788 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 5352, 7250, 56788 is 2.
HCF(5352, 7250, 56788) = 2
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 5352, 7250, 56788 is 2.
Step 1: Since 7250 > 5352, we apply the division lemma to 7250 and 5352, to get
7250 = 5352 x 1 + 1898
Step 2: Since the reminder 5352 ≠ 0, we apply division lemma to 1898 and 5352, to get
5352 = 1898 x 2 + 1556
Step 3: We consider the new divisor 1898 and the new remainder 1556, and apply the division lemma to get
1898 = 1556 x 1 + 342
We consider the new divisor 1556 and the new remainder 342,and apply the division lemma to get
1556 = 342 x 4 + 188
We consider the new divisor 342 and the new remainder 188,and apply the division lemma to get
342 = 188 x 1 + 154
We consider the new divisor 188 and the new remainder 154,and apply the division lemma to get
188 = 154 x 1 + 34
We consider the new divisor 154 and the new remainder 34,and apply the division lemma to get
154 = 34 x 4 + 18
We consider the new divisor 34 and the new remainder 18,and apply the division lemma to get
34 = 18 x 1 + 16
We consider the new divisor 18 and the new remainder 16,and apply the division lemma to get
18 = 16 x 1 + 2
We consider the new divisor 16 and the new remainder 2,and apply the division lemma to get
16 = 2 x 8 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 5352 and 7250 is 2
Notice that 2 = HCF(16,2) = HCF(18,16) = HCF(34,18) = HCF(154,34) = HCF(188,154) = HCF(342,188) = HCF(1556,342) = HCF(1898,1556) = HCF(5352,1898) = HCF(7250,5352) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 56788 > 2, we apply the division lemma to 56788 and 2, to get
56788 = 2 x 28394 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 2 and 56788 is 2
Notice that 2 = HCF(56788,2) .
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 5352, 7250, 56788?
Answer: HCF of 5352, 7250, 56788 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 5352, 7250, 56788 using Euclid's Algorithm?
Answer: For arbitrary numbers 5352, 7250, 56788 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.