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