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

HCF of 2402, 9972, 69795 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 2402, 9972, 69795 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 2402, 9972, 69795 is 1.

HCF(2402, 9972, 69795) = 1

HCF of 2402, 9972, 69795 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 2402, 9972, 69795 is 1.

Highest Common Factor of 2402,9972,69795 using Euclid's algorithm

Highest Common Factor of 2402,9972,69795 is 1

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

9972 = 2402 x 4 + 364

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

2402 = 364 x 6 + 218

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

364 = 218 x 1 + 146

We consider the new divisor 218 and the new remainder 146,and apply the division lemma to get

218 = 146 x 1 + 72

We consider the new divisor 146 and the new remainder 72,and apply the division lemma to get

146 = 72 x 2 + 2

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

72 = 2 x 36 + 0

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

Notice that 2 = HCF(72,2) = HCF(146,72) = HCF(218,146) = HCF(364,218) = HCF(2402,364) = HCF(9972,2402) .

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

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

69795 = 2 x 34897 + 1

Step 2: Since the reminder 2 ≠ 0, we apply division lemma to 1 and 2, 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 2 and 69795 is 1

Notice that 1 = HCF(2,1) = HCF(69795,2) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 2402, 9972, 69795 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 2402, 9972, 69795?

Answer: HCF of 2402, 9972, 69795 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 2402, 9972, 69795 using Euclid's Algorithm?

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