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 2828, 3817 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 2828, 3817 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 2828, 3817 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 2828, 3817 is 1.
HCF(2828, 3817) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 2828, 3817 is 1.
Step 1: Since 3817 > 2828, we apply the division lemma to 3817 and 2828, to get
3817 = 2828 x 1 + 989
Step 2: Since the reminder 2828 ≠ 0, we apply division lemma to 989 and 2828, to get
2828 = 989 x 2 + 850
Step 3: We consider the new divisor 989 and the new remainder 850, and apply the division lemma to get
989 = 850 x 1 + 139
We consider the new divisor 850 and the new remainder 139,and apply the division lemma to get
850 = 139 x 6 + 16
We consider the new divisor 139 and the new remainder 16,and apply the division lemma to get
139 = 16 x 8 + 11
We consider the new divisor 16 and the new remainder 11,and apply the division lemma to get
16 = 11 x 1 + 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 2828 and 3817 is 1
Notice that 1 = HCF(5,1) = HCF(11,5) = HCF(16,11) = HCF(139,16) = HCF(850,139) = HCF(989,850) = HCF(2828,989) = HCF(3817,2828) .
Here are some samples of HCF using Euclid's Algorithm calculations.
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 2828, 3817?
Answer: HCF of 2828, 3817 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 2828, 3817 using Euclid's Algorithm?
Answer: For arbitrary numbers 2828, 3817 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.