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