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

HCF of 848, 618, 345 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 848, 618, 345 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 848, 618, 345 is 1.

HCF(848, 618, 345) = 1

HCF of 848, 618, 345 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 848, 618, 345 is 1.

Highest Common Factor of 848,618,345 using Euclid's algorithm

Highest Common Factor of 848,618,345 is 1

Step 1: Since 848 > 618, we apply the division lemma to 848 and 618, to get

848 = 618 x 1 + 230

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

618 = 230 x 2 + 158

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

230 = 158 x 1 + 72

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

158 = 72 x 2 + 14

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

72 = 14 x 5 + 2

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

14 = 2 x 7 + 0

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

Notice that 2 = HCF(14,2) = HCF(72,14) = HCF(158,72) = HCF(230,158) = HCF(618,230) = HCF(848,618) .


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

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

345 = 2 x 172 + 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 345 is 1

Notice that 1 = HCF(2,1) = HCF(345,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 848, 618, 345 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 848, 618, 345?

Answer: HCF of 848, 618, 345 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 848, 618, 345 using Euclid's Algorithm?

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