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

HCF of 2245, 8052, 15348 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 2245, 8052, 15348 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 2245, 8052, 15348 is 1.

HCF(2245, 8052, 15348) = 1

HCF of 2245, 8052, 15348 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 2245, 8052, 15348 is 1.

Highest Common Factor of 2245,8052,15348 using Euclid's algorithm

Highest Common Factor of 2245,8052,15348 is 1

Step 1: Since 8052 > 2245, we apply the division lemma to 8052 and 2245, to get

8052 = 2245 x 3 + 1317

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

2245 = 1317 x 1 + 928

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

1317 = 928 x 1 + 389

We consider the new divisor 928 and the new remainder 389,and apply the division lemma to get

928 = 389 x 2 + 150

We consider the new divisor 389 and the new remainder 150,and apply the division lemma to get

389 = 150 x 2 + 89

We consider the new divisor 150 and the new remainder 89,and apply the division lemma to get

150 = 89 x 1 + 61

We consider the new divisor 89 and the new remainder 61,and apply the division lemma to get

89 = 61 x 1 + 28

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

61 = 28 x 2 + 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 2245 and 8052 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(28,5) = HCF(61,28) = HCF(89,61) = HCF(150,89) = HCF(389,150) = HCF(928,389) = HCF(1317,928) = HCF(2245,1317) = HCF(8052,2245) .

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

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

15348 = 1 x 15348 + 0

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

Notice that 1 = HCF(15348,1) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 2245, 8052, 15348 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 2245, 8052, 15348?

Answer: HCF of 2245, 8052, 15348 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 2245, 8052, 15348 using Euclid's Algorithm?

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