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