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