Highest Common Factor of 5389, 7405 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 5389, 7405 i.e. 1 the largest integer that leaves a remainder zero for all numbers.

HCF of 5389, 7405 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 5389, 7405 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 5389, 7405 is 1.

HCF(5389, 7405) = 1

HCF of 5389, 7405 using Euclid's algorithm

Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.

HCF of:

Highest common factor (HCF) of 5389, 7405 is 1.

Highest Common Factor of 5389,7405 using Euclid's algorithm

Highest Common Factor of 5389,7405 is 1

Step 1: Since 7405 > 5389, we apply the division lemma to 7405 and 5389, to get

7405 = 5389 x 1 + 2016

Step 2: Since the reminder 5389 ≠ 0, we apply division lemma to 2016 and 5389, to get

5389 = 2016 x 2 + 1357

Step 3: We consider the new divisor 2016 and the new remainder 1357, and apply the division lemma to get

2016 = 1357 x 1 + 659

We consider the new divisor 1357 and the new remainder 659,and apply the division lemma to get

1357 = 659 x 2 + 39

We consider the new divisor 659 and the new remainder 39,and apply the division lemma to get

659 = 39 x 16 + 35

We consider the new divisor 39 and the new remainder 35,and apply the division lemma to get

39 = 35 x 1 + 4

We consider the new divisor 35 and the new remainder 4,and apply the division lemma to get

35 = 4 x 8 + 3

We consider the new divisor 4 and the new remainder 3,and apply the division lemma to get

4 = 3 x 1 + 1

We consider the new divisor 3 and the new remainder 1,and apply the division lemma to get

3 = 1 x 3 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 5389 and 7405 is 1

Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(35,4) = HCF(39,35) = HCF(659,39) = HCF(1357,659) = HCF(2016,1357) = HCF(5389,2016) = HCF(7405,5389) .

HCF using Euclid's Algorithm Calculation Examples

Here are some samples of HCF using Euclid's Algorithm calculations.

Frequently Asked Questions on HCF of 5389, 7405 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 5389, 7405?

Answer: HCF of 5389, 7405 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 5389, 7405 using Euclid's Algorithm?

Answer: For arbitrary numbers 5389, 7405 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.