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