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