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