Question

Find HCF of 1656 and 4025 by Euclid’s division algorithm and hence find LCM.

Answer 1

Answer:

Given numbers are 1656 and 4025 By Euclid division algorithm For given positive integers a and b, there exist whole numbers q and r satisfying a = bq + r, 0 ≤ r < b Now, ⇒ 4025 = 1656 x 2 + 713 ⇒ 1656 = 713 x 2 + 230 ⇒ 713 = 230 x 3 + 23 ⇒ 230 = 23 x 10 + 0 ∴ HCF of 1656 and 4025 = 23.

Step-by-step explanation:

here's the answer please follow me