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