Highest Common Factor of 798, 898, 381, 536 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, 898, 381, 536 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 798, 898, 381, 536 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 798, 898, 381, 536 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, 898, 381, 536 is 1.
HCF(798, 898, 381, 536) = 1
HCF of 798, 898, 381, 536 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, 898, 381, 536 is 1.
Highest Common Factor of 798,898,381,536 is 1
Step 1: Since 898 > 798, we apply the division lemma to 898 and 798, to get
898 = 798 x 1 + 100
Step 2: Since the reminder 798 ≠ 0, we apply division lemma to 100 and 798, to get
798 = 100 x 7 + 98
Step 3: We consider the new divisor 100 and the new remainder 98, and apply the division lemma to get
100 = 98 x 1 + 2
We consider the new divisor 98 and the new remainder 2, and apply the division lemma to get
98 = 2 x 49 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 798 and 898 is 2
Notice that 2 = HCF(98,2) = HCF(100,98) = HCF(798,100) = HCF(898,798) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 381 > 2, we apply the division lemma to 381 and 2, to get
381 = 2 x 190 + 1
Step 2: Since the reminder 2 ≠ 0, we apply division lemma to 1 and 2, 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 2 and 381 is 1
Notice that 1 = HCF(2,1) = HCF(381,2) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 536 > 1, we apply the division lemma to 536 and 1, to get
536 = 1 x 536 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 1 and 536 is 1
Notice that 1 = HCF(536,1) .
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, 898, 381, 536 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, 898, 381, 536?
Answer: HCF of 798, 898, 381, 536 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 798, 898, 381, 536 using Euclid's Algorithm?
Answer: For arbitrary numbers 798, 898, 381, 536 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.