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