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