Highest Common Factor of 3331, 5372, 21880 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 3331, 5372, 21880 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 3331, 5372, 21880 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 3331, 5372, 21880 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 3331, 5372, 21880 is 1.
HCF(3331, 5372, 21880) = 1
HCF of 3331, 5372, 21880 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 3331, 5372, 21880 is 1.
Highest Common Factor of 3331,5372,21880 is 1
Step 1: Since 5372 > 3331, we apply the division lemma to 5372 and 3331, to get
5372 = 3331 x 1 + 2041
Step 2: Since the reminder 3331 ≠ 0, we apply division lemma to 2041 and 3331, to get
3331 = 2041 x 1 + 1290
Step 3: We consider the new divisor 2041 and the new remainder 1290, and apply the division lemma to get
2041 = 1290 x 1 + 751
We consider the new divisor 1290 and the new remainder 751,and apply the division lemma to get
1290 = 751 x 1 + 539
We consider the new divisor 751 and the new remainder 539,and apply the division lemma to get
751 = 539 x 1 + 212
We consider the new divisor 539 and the new remainder 212,and apply the division lemma to get
539 = 212 x 2 + 115
We consider the new divisor 212 and the new remainder 115,and apply the division lemma to get
212 = 115 x 1 + 97
We consider the new divisor 115 and the new remainder 97,and apply the division lemma to get
115 = 97 x 1 + 18
We consider the new divisor 97 and the new remainder 18,and apply the division lemma to get
97 = 18 x 5 + 7
We consider the new divisor 18 and the new remainder 7,and apply the division lemma to get
18 = 7 x 2 + 4
We consider the new divisor 7 and the new remainder 4,and apply the division lemma to get
7 = 4 x 1 + 3
We consider the new divisor 4 and the new remainder 3,and apply the division lemma to get
4 = 3 x 1 + 1
We consider the new divisor 3 and the new remainder 1,and apply the division lemma to get
3 = 1 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 3331 and 5372 is 1
Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(7,4) = HCF(18,7) = HCF(97,18) = HCF(115,97) = HCF(212,115) = HCF(539,212) = HCF(751,539) = HCF(1290,751) = HCF(2041,1290) = HCF(3331,2041) = HCF(5372,3331) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 21880 > 1, we apply the division lemma to 21880 and 1, to get
21880 = 1 x 21880 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 1 and 21880 is 1
Notice that 1 = HCF(21880,1) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 3331, 5372, 21880 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 3331, 5372, 21880?
Answer: HCF of 3331, 5372, 21880 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 3331, 5372, 21880 using Euclid's Algorithm?
Answer: For arbitrary numbers 3331, 5372, 21880 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.