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

HCF of 2659, 6021, 77242 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 2659, 6021, 77242 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 2659, 6021, 77242 is 1.

HCF(2659, 6021, 77242) = 1

HCF of 2659, 6021, 77242 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 2659, 6021, 77242 is 1.

Highest Common Factor of 2659,6021,77242 using Euclid's algorithm

Highest Common Factor of 2659,6021,77242 is 1

Step 1: Since 6021 > 2659, we apply the division lemma to 6021 and 2659, to get

6021 = 2659 x 2 + 703

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

2659 = 703 x 3 + 550

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

703 = 550 x 1 + 153

We consider the new divisor 550 and the new remainder 153,and apply the division lemma to get

550 = 153 x 3 + 91

We consider the new divisor 153 and the new remainder 91,and apply the division lemma to get

153 = 91 x 1 + 62

We consider the new divisor 91 and the new remainder 62,and apply the division lemma to get

91 = 62 x 1 + 29

We consider the new divisor 62 and the new remainder 29,and apply the division lemma to get

62 = 29 x 2 + 4

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

29 = 4 x 7 + 1

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

4 = 1 x 4 + 0

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

Notice that 1 = HCF(4,1) = HCF(29,4) = HCF(62,29) = HCF(91,62) = HCF(153,91) = HCF(550,153) = HCF(703,550) = HCF(2659,703) = HCF(6021,2659) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

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

77242 = 1 x 77242 + 0

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

Notice that 1 = HCF(77242,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 2659, 6021, 77242 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 2659, 6021, 77242?

Answer: HCF of 2659, 6021, 77242 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 2659, 6021, 77242 using Euclid's Algorithm?

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