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