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