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

HCF of 6868, 5959, 40848 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 6868, 5959, 40848 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 6868, 5959, 40848 is 1.

HCF(6868, 5959, 40848) = 1

HCF of 6868, 5959, 40848 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 6868, 5959, 40848 is 1.

Highest Common Factor of 6868,5959,40848 using Euclid's algorithm

Highest Common Factor of 6868,5959,40848 is 1

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

6868 = 5959 x 1 + 909

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

5959 = 909 x 6 + 505

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

909 = 505 x 1 + 404

We consider the new divisor 505 and the new remainder 404,and apply the division lemma to get

505 = 404 x 1 + 101

We consider the new divisor 404 and the new remainder 101,and apply the division lemma to get

404 = 101 x 4 + 0

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

Notice that 101 = HCF(404,101) = HCF(505,404) = HCF(909,505) = HCF(5959,909) = HCF(6868,5959) .

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

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

40848 = 101 x 404 + 44

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

101 = 44 x 2 + 13

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

44 = 13 x 3 + 5

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

13 = 5 x 2 + 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 101 and 40848 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(13,5) = HCF(44,13) = HCF(101,44) = HCF(40848,101) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 6868, 5959, 40848 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 6868, 5959, 40848?

Answer: HCF of 6868, 5959, 40848 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 6868, 5959, 40848 using Euclid's Algorithm?

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