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

HCF of 5009, 9653 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 5009, 9653 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 5009, 9653 is 1.

HCF(5009, 9653) = 1

HCF of 5009, 9653 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 5009, 9653 is 1.

Highest Common Factor of 5009,9653 using Euclid's algorithm

Highest Common Factor of 5009,9653 is 1

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

9653 = 5009 x 1 + 4644

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

5009 = 4644 x 1 + 365

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

4644 = 365 x 12 + 264

We consider the new divisor 365 and the new remainder 264,and apply the division lemma to get

365 = 264 x 1 + 101

We consider the new divisor 264 and the new remainder 101,and apply the division lemma to get

264 = 101 x 2 + 62

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

101 = 62 x 1 + 39

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

62 = 39 x 1 + 23

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

39 = 23 x 1 + 16

We consider the new divisor 23 and the new remainder 16,and apply the division lemma to get

23 = 16 x 1 + 7

We consider the new divisor 16 and the new remainder 7,and apply the division lemma to get

16 = 7 x 2 + 2

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

7 = 2 x 3 + 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 5009 and 9653 is 1

Notice that 1 = HCF(2,1) = HCF(7,2) = HCF(16,7) = HCF(23,16) = HCF(39,23) = HCF(62,39) = HCF(101,62) = HCF(264,101) = HCF(365,264) = HCF(4644,365) = HCF(5009,4644) = HCF(9653,5009) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 5009, 9653 using Euclid's Algorithm?

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