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