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