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