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