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