Highest Common Factor of 6242, 8080, 78770 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 6242, 8080, 78770 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 6242, 8080, 78770 is 2 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 6242, 8080, 78770 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 6242, 8080, 78770 is 2.
HCF(6242, 8080, 78770) = 2
HCF of 6242, 8080, 78770 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 6242, 8080, 78770 is 2.
Highest Common Factor of 6242,8080,78770 is 2
Step 1: Since 8080 > 6242, we apply the division lemma to 8080 and 6242, to get
8080 = 6242 x 1 + 1838
Step 2: Since the reminder 6242 ≠ 0, we apply division lemma to 1838 and 6242, to get
6242 = 1838 x 3 + 728
Step 3: We consider the new divisor 1838 and the new remainder 728, and apply the division lemma to get
1838 = 728 x 2 + 382
We consider the new divisor 728 and the new remainder 382,and apply the division lemma to get
728 = 382 x 1 + 346
We consider the new divisor 382 and the new remainder 346,and apply the division lemma to get
382 = 346 x 1 + 36
We consider the new divisor 346 and the new remainder 36,and apply the division lemma to get
346 = 36 x 9 + 22
We consider the new divisor 36 and the new remainder 22,and apply the division lemma to get
36 = 22 x 1 + 14
We consider the new divisor 22 and the new remainder 14,and apply the division lemma to get
22 = 14 x 1 + 8
We consider the new divisor 14 and the new remainder 8,and apply the division lemma to get
14 = 8 x 1 + 6
We consider the new divisor 8 and the new remainder 6,and apply the division lemma to get
8 = 6 x 1 + 2
We consider the new divisor 6 and the new remainder 2,and apply the division lemma to get
6 = 2 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 6242 and 8080 is 2
Notice that 2 = HCF(6,2) = HCF(8,6) = HCF(14,8) = HCF(22,14) = HCF(36,22) = HCF(346,36) = HCF(382,346) = HCF(728,382) = HCF(1838,728) = HCF(6242,1838) = HCF(8080,6242) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 78770 > 2, we apply the division lemma to 78770 and 2, to get
78770 = 2 x 39385 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 2 and 78770 is 2
Notice that 2 = HCF(78770,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 6242, 8080, 78770 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 6242, 8080, 78770?
Answer: HCF of 6242, 8080, 78770 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 6242, 8080, 78770 using Euclid's Algorithm?
Answer: For arbitrary numbers 6242, 8080, 78770 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.