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