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

HCF of 915, 39821 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 915, 39821 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 915, 39821 is 1.

HCF(915, 39821) = 1

HCF of 915, 39821 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 915, 39821 is 1.

Highest Common Factor of 915,39821 using Euclid's algorithm

Highest Common Factor of 915,39821 is 1

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

39821 = 915 x 43 + 476

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

915 = 476 x 1 + 439

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

476 = 439 x 1 + 37

We consider the new divisor 439 and the new remainder 37,and apply the division lemma to get

439 = 37 x 11 + 32

We consider the new divisor 37 and the new remainder 32,and apply the division lemma to get

37 = 32 x 1 + 5

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

32 = 5 x 6 + 2

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

5 = 2 x 2 + 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 915 and 39821 is 1

Notice that 1 = HCF(2,1) = HCF(5,2) = HCF(32,5) = HCF(37,32) = HCF(439,37) = HCF(476,439) = HCF(915,476) = HCF(39821,915) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 915, 39821 using Euclid's Algorithm?

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