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