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