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