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