Highest Common Factor of 794, 7801 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 794, 7801 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 794, 7801 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 794, 7801 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 794, 7801 is 1.
HCF(794, 7801) = 1
HCF of 794, 7801 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 794, 7801 is 1.
Highest Common Factor of 794,7801 is 1
Step 1: Since 7801 > 794, we apply the division lemma to 7801 and 794, to get
7801 = 794 x 9 + 655
Step 2: Since the reminder 794 ≠ 0, we apply division lemma to 655 and 794, to get
794 = 655 x 1 + 139
Step 3: We consider the new divisor 655 and the new remainder 139, and apply the division lemma to get
655 = 139 x 4 + 99
We consider the new divisor 139 and the new remainder 99,and apply the division lemma to get
139 = 99 x 1 + 40
We consider the new divisor 99 and the new remainder 40,and apply the division lemma to get
99 = 40 x 2 + 19
We consider the new divisor 40 and the new remainder 19,and apply the division lemma to get
40 = 19 x 2 + 2
We consider the new divisor 19 and the new remainder 2,and apply the division lemma to get
19 = 2 x 9 + 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 794 and 7801 is 1
Notice that 1 = HCF(2,1) = HCF(19,2) = HCF(40,19) = HCF(99,40) = HCF(139,99) = HCF(655,139) = HCF(794,655) = HCF(7801,794) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 794, 7801 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 794, 7801?
Answer: HCF of 794, 7801 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 794, 7801 using Euclid's Algorithm?
Answer: For arbitrary numbers 794, 7801 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.