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