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