Find hcf of 126,144,204 by euclid algorithm
Answers
Answered by
3
Answer:
1st number = 2^2 x 3^3 x 5^5 x 7^0 x 11^0
2nd number = 2^3 x 3^2 x 5^2 x 7^1 x 11^0
3rd number = 2^4 x 3^4 x 5^1 x 7^2 x 11^1
Then we take the lowest exponent for all the prime factors
They are:
2^2
3^2
5^1
7^0 (note that for 7 and 11, the lowest exponent is 0 not 1)
11^0
Multiply them all for the HCF
HCF = 2^2 x 3^2 x 5^1 x 7^0 x 11^0 = 4 x 9 x 5 x 1 x 1 = 180
Step-by-step explanation:
Similar questions