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