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

HCF of 9948, 5335 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 9948, 5335 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 9948, 5335 is 1.

HCF(9948, 5335) = 1

HCF of 9948, 5335 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 9948, 5335 is 1.

Highest Common Factor of 9948,5335 using Euclid's algorithm

Highest Common Factor of 9948,5335 is 1

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

9948 = 5335 x 1 + 4613

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

5335 = 4613 x 1 + 722

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

4613 = 722 x 6 + 281

We consider the new divisor 722 and the new remainder 281,and apply the division lemma to get

722 = 281 x 2 + 160

We consider the new divisor 281 and the new remainder 160,and apply the division lemma to get

281 = 160 x 1 + 121

We consider the new divisor 160 and the new remainder 121,and apply the division lemma to get

160 = 121 x 1 + 39

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

121 = 39 x 3 + 4

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

39 = 4 x 9 + 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 9948 and 5335 is 1

Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(39,4) = HCF(121,39) = HCF(160,121) = HCF(281,160) = HCF(722,281) = HCF(4613,722) = HCF(5335,4613) = HCF(9948,5335) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 9948, 5335 using Euclid's Algorithm?

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