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