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