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