Question

4. Using Euclid's division algorithm, find the HCF of
(i) 612 and 1314
14​

Answer 1

Step-by-step explanation:

HCF (1314 , 612 ) product of smallest power of each common prime factor in the numbers = 2×3×3 = 18. LCM(1314, 612) product of highest power of each prime factor involved in the numbers = 2×2×3×3×17×73 = 44,676

Answer 2

Answer:

Given find the HCF by using Euclid division Lemma of 612 and 1314. Now remainder is zero and therefore b is the final step is 18 and so hcf of 612 and 1314 is 18.

hope it helps you pls mark me as brainlist answer I will help u whenever u need help I m a teacher and the answer is correct Plzzzz read the answer carefully dear user it will be very helpful and great answer.........