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