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

HCF of 2636, 9609 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 2636, 9609 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 2636, 9609 is 1.

HCF(2636, 9609) = 1

HCF of 2636, 9609 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 2636, 9609 is 1.

Highest Common Factor of 2636,9609 using Euclid's algorithm

Highest Common Factor of 2636,9609 is 1

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

9609 = 2636 x 3 + 1701

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

2636 = 1701 x 1 + 935

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

1701 = 935 x 1 + 766

We consider the new divisor 935 and the new remainder 766,and apply the division lemma to get

935 = 766 x 1 + 169

We consider the new divisor 766 and the new remainder 169,and apply the division lemma to get

766 = 169 x 4 + 90

We consider the new divisor 169 and the new remainder 90,and apply the division lemma to get

169 = 90 x 1 + 79

We consider the new divisor 90 and the new remainder 79,and apply the division lemma to get

90 = 79 x 1 + 11

We consider the new divisor 79 and the new remainder 11,and apply the division lemma to get

79 = 11 x 7 + 2

We consider the new divisor 11 and the new remainder 2,and apply the division lemma to get

11 = 2 x 5 + 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 2636 and 9609 is 1

Notice that 1 = HCF(2,1) = HCF(11,2) = HCF(79,11) = HCF(90,79) = HCF(169,90) = HCF(766,169) = HCF(935,766) = HCF(1701,935) = HCF(2636,1701) = HCF(9609,2636) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 2636, 9609 using Euclid's Algorithm?

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