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 4871, 1513 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 4871, 1513 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 4871, 1513 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 4871, 1513 is 1.
HCF(4871, 1513) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 4871, 1513 is 1.
Step 1: Since 4871 > 1513, we apply the division lemma to 4871 and 1513, to get
4871 = 1513 x 3 + 332
Step 2: Since the reminder 1513 ≠ 0, we apply division lemma to 332 and 1513, to get
1513 = 332 x 4 + 185
Step 3: We consider the new divisor 332 and the new remainder 185, and apply the division lemma to get
332 = 185 x 1 + 147
We consider the new divisor 185 and the new remainder 147,and apply the division lemma to get
185 = 147 x 1 + 38
We consider the new divisor 147 and the new remainder 38,and apply the division lemma to get
147 = 38 x 3 + 33
We consider the new divisor 38 and the new remainder 33,and apply the division lemma to get
38 = 33 x 1 + 5
We consider the new divisor 33 and the new remainder 5,and apply the division lemma to get
33 = 5 x 6 + 3
We consider the new divisor 5 and the new remainder 3,and apply the division lemma to get
5 = 3 x 1 + 2
We consider the new divisor 3 and the new remainder 2,and apply the division lemma to get
3 = 2 x 1 + 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 4871 and 1513 is 1
Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(33,5) = HCF(38,33) = HCF(147,38) = HCF(185,147) = HCF(332,185) = HCF(1513,332) = HCF(4871,1513) .
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 4871, 1513?
Answer: HCF of 4871, 1513 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 4871, 1513 using Euclid's Algorithm?
Answer: For arbitrary numbers 4871, 1513 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.