Highest Common Factor of 813, 15152 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 813, 15152 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 813, 15152 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 813, 15152 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 813, 15152 is 1.
HCF(813, 15152) = 1
HCF of 813, 15152 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 813, 15152 is 1.
Highest Common Factor of 813,15152 is 1
Step 1: Since 15152 > 813, we apply the division lemma to 15152 and 813, to get
15152 = 813 x 18 + 518
Step 2: Since the reminder 813 ≠ 0, we apply division lemma to 518 and 813, to get
813 = 518 x 1 + 295
Step 3: We consider the new divisor 518 and the new remainder 295, and apply the division lemma to get
518 = 295 x 1 + 223
We consider the new divisor 295 and the new remainder 223,and apply the division lemma to get
295 = 223 x 1 + 72
We consider the new divisor 223 and the new remainder 72,and apply the division lemma to get
223 = 72 x 3 + 7
We consider the new divisor 72 and the new remainder 7,and apply the division lemma to get
72 = 7 x 10 + 2
We consider the new divisor 7 and the new remainder 2,and apply the division lemma to get
7 = 2 x 3 + 1
We consider the new divisor 2 and the new remainder 1,and apply the division lemma 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 813 and 15152 is 1
Notice that 1 = HCF(2,1) = HCF(7,2) = HCF(72,7) = HCF(223,72) = HCF(295,223) = HCF(518,295) = HCF(813,518) = HCF(15152,813) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 813, 15152 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 813, 15152?
Answer: HCF of 813, 15152 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 813, 15152 using Euclid's Algorithm?
Answer: For arbitrary numbers 813, 15152 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.
