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