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