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