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