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