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