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