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 8235, 6748 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 8235, 6748 is 1 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 8235, 6748 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 8235, 6748 is 1.
HCF(8235, 6748) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 8235, 6748 is 1.
Step 1: Since 8235 > 6748, we apply the division lemma to 8235 and 6748, to get
8235 = 6748 x 1 + 1487
Step 2: Since the reminder 6748 ≠ 0, we apply division lemma to 1487 and 6748, to get
6748 = 1487 x 4 + 800
Step 3: We consider the new divisor 1487 and the new remainder 800, and apply the division lemma to get
1487 = 800 x 1 + 687
We consider the new divisor 800 and the new remainder 687,and apply the division lemma to get
800 = 687 x 1 + 113
We consider the new divisor 687 and the new remainder 113,and apply the division lemma to get
687 = 113 x 6 + 9
We consider the new divisor 113 and the new remainder 9,and apply the division lemma to get
113 = 9 x 12 + 5
We consider the new divisor 9 and the new remainder 5,and apply the division lemma to get
9 = 5 x 1 + 4
We consider the new divisor 5 and the new remainder 4,and apply the division lemma to get
5 = 4 x 1 + 1
We consider the new divisor 4 and the new remainder 1,and apply the division lemma to get
4 = 1 x 4 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 8235 and 6748 is 1
Notice that 1 = HCF(4,1) = HCF(5,4) = HCF(9,5) = HCF(113,9) = HCF(687,113) = HCF(800,687) = HCF(1487,800) = HCF(6748,1487) = HCF(8235,6748) .
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 8235, 6748?
Answer: HCF of 8235, 6748 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 8235, 6748 using Euclid's Algorithm?
Answer: For arbitrary numbers 8235, 6748 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.