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