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