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