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