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