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