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