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 852, 62789 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 852, 62789 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 852, 62789 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 852, 62789 is 1.
HCF(852, 62789) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 852, 62789 is 1.
Step 1: Since 62789 > 852, we apply the division lemma to 62789 and 852, to get
62789 = 852 x 73 + 593
Step 2: Since the reminder 852 ≠ 0, we apply division lemma to 593 and 852, to get
852 = 593 x 1 + 259
Step 3: We consider the new divisor 593 and the new remainder 259, and apply the division lemma to get
593 = 259 x 2 + 75
We consider the new divisor 259 and the new remainder 75,and apply the division lemma to get
259 = 75 x 3 + 34
We consider the new divisor 75 and the new remainder 34,and apply the division lemma to get
75 = 34 x 2 + 7
We consider the new divisor 34 and the new remainder 7,and apply the division lemma to get
34 = 7 x 4 + 6
We consider the new divisor 7 and the new remainder 6,and apply the division lemma to get
7 = 6 x 1 + 1
We consider the new divisor 6 and the new remainder 1,and apply the division lemma to get
6 = 1 x 6 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 852 and 62789 is 1
Notice that 1 = HCF(6,1) = HCF(7,6) = HCF(34,7) = HCF(75,34) = HCF(259,75) = HCF(593,259) = HCF(852,593) = HCF(62789,852) .
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 852, 62789?
Answer: HCF of 852, 62789 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 852, 62789 using Euclid's Algorithm?
Answer: For arbitrary numbers 852, 62789 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.