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