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

HCF of 2395, 6738 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 2395, 6738 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 2395, 6738 is 1.

HCF(2395, 6738) = 1

HCF of 2395, 6738 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 2395, 6738 is 1.

Highest Common Factor of 2395,6738 using Euclid's algorithm

Highest Common Factor of 2395,6738 is 1

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

6738 = 2395 x 2 + 1948

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

2395 = 1948 x 1 + 447

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

1948 = 447 x 4 + 160

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

447 = 160 x 2 + 127

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

160 = 127 x 1 + 33

We consider the new divisor 127 and the new remainder 33,and apply the division lemma to get

127 = 33 x 3 + 28

We consider the new divisor 33 and the new remainder 28,and apply the division lemma to get

33 = 28 x 1 + 5

We consider the new divisor 28 and the new remainder 5,and apply the division lemma to get

28 = 5 x 5 + 3

We consider the new divisor 5 and the new remainder 3,and apply the division lemma to get

5 = 3 x 1 + 2

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

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

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(28,5) = HCF(33,28) = HCF(127,33) = HCF(160,127) = HCF(447,160) = HCF(1948,447) = HCF(2395,1948) = HCF(6738,2395) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 2395, 6738 using Euclid's Algorithm?

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