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