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