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