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 6783, 8238 i.e. 3 the largest integer that leaves a remainder zero for all numbers.
HCF of 6783, 8238 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 6783, 8238 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 6783, 8238 is 3.
HCF(6783, 8238) = 3
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 6783, 8238 is 3.
Step 1: Since 8238 > 6783, we apply the division lemma to 8238 and 6783, to get
8238 = 6783 x 1 + 1455
Step 2: Since the reminder 6783 ≠ 0, we apply division lemma to 1455 and 6783, to get
6783 = 1455 x 4 + 963
Step 3: We consider the new divisor 1455 and the new remainder 963, and apply the division lemma to get
1455 = 963 x 1 + 492
We consider the new divisor 963 and the new remainder 492,and apply the division lemma to get
963 = 492 x 1 + 471
We consider the new divisor 492 and the new remainder 471,and apply the division lemma to get
492 = 471 x 1 + 21
We consider the new divisor 471 and the new remainder 21,and apply the division lemma to get
471 = 21 x 22 + 9
We consider the new divisor 21 and the new remainder 9,and apply the division lemma to get
21 = 9 x 2 + 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 6783 and 8238 is 3
Notice that 3 = HCF(9,3) = HCF(21,9) = HCF(471,21) = HCF(492,471) = HCF(963,492) = HCF(1455,963) = HCF(6783,1455) = HCF(8238,6783) .
Here are some samples of HCF using Euclid's Algorithm calculations.
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 6783, 8238?
Answer: HCF of 6783, 8238 is 3 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 6783, 8238 using Euclid's Algorithm?
Answer: For arbitrary numbers 6783, 8238 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.