Highest Common Factor of 801, 438 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, 438 i.e. 3 the largest integer that leaves a remainder zero for all numbers.
HCF of 801, 438 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, 438 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, 438 is 3.
HCF(801, 438) = 3
HCF of 801, 438 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, 438 is 3.
Highest Common Factor of 801,438 is 3
Step 1: Since 801 > 438, we apply the division lemma to 801 and 438, to get
801 = 438 x 1 + 363
Step 2: Since the reminder 438 ≠ 0, we apply division lemma to 363 and 438, to get
438 = 363 x 1 + 75
Step 3: We consider the new divisor 363 and the new remainder 75, and apply the division lemma to get
363 = 75 x 4 + 63
We consider the new divisor 75 and the new remainder 63,and apply the division lemma to get
75 = 63 x 1 + 12
We consider the new divisor 63 and the new remainder 12,and apply the division lemma to get
63 = 12 x 5 + 3
We consider the new divisor 12 and the new remainder 3,and apply the division lemma to get
12 = 3 x 4 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 3, the HCF of 801 and 438 is 3
Notice that 3 = HCF(12,3) = HCF(63,12) = HCF(75,63) = HCF(363,75) = HCF(438,363) = HCF(801,438) .
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, 438 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, 438?
Answer: HCF of 801, 438 is 3 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 801, 438 using Euclid's Algorithm?
Answer: For arbitrary numbers 801, 438 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.
