Highest Common Factor of 6136, 2868, 90809 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 6136, 2868, 90809 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 6136, 2868, 90809 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 6136, 2868, 90809 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 6136, 2868, 90809 is 1.
HCF(6136, 2868, 90809) = 1
HCF of 6136, 2868, 90809 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 6136, 2868, 90809 is 1.
Highest Common Factor of 6136,2868,90809 is 1
Step 1: Since 6136 > 2868, we apply the division lemma to 6136 and 2868, to get
6136 = 2868 x 2 + 400
Step 2: Since the reminder 2868 ≠ 0, we apply division lemma to 400 and 2868, to get
2868 = 400 x 7 + 68
Step 3: We consider the new divisor 400 and the new remainder 68, and apply the division lemma to get
400 = 68 x 5 + 60
We consider the new divisor 68 and the new remainder 60,and apply the division lemma to get
68 = 60 x 1 + 8
We consider the new divisor 60 and the new remainder 8,and apply the division lemma to get
60 = 8 x 7 + 4
We consider the new divisor 8 and the new remainder 4,and apply the division lemma to get
8 = 4 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 4, the HCF of 6136 and 2868 is 4
Notice that 4 = HCF(8,4) = HCF(60,8) = HCF(68,60) = HCF(400,68) = HCF(2868,400) = HCF(6136,2868) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 90809 > 4, we apply the division lemma to 90809 and 4, to get
90809 = 4 x 22702 + 1
Step 2: Since the reminder 4 ≠ 0, we apply division lemma to 1 and 4, to get
4 = 1 x 4 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 4 and 90809 is 1
Notice that 1 = HCF(4,1) = HCF(90809,4) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 6136, 2868, 90809 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 6136, 2868, 90809?
Answer: HCF of 6136, 2868, 90809 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 6136, 2868, 90809 using Euclid's Algorithm?
Answer: For arbitrary numbers 6136, 2868, 90809 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.
