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