Find the $\text{g.c.d.}$ (Greatest Common Divisor) of $196$ and $38220$ using Euclid's division algorithm.

If $HCF(a, b) = 16$,then which of the following cannot be the $LCM(a, b)$?

Find the $HCF$ of $96$ and $404$ by the prime factorisation method. Hence,find their $LCM$.

On a morning walk,three persons step off together and their steps measure $40\, cm$,$42\, cm$ and $45\, cm$,respectively. What is the minimum distance each should walk so that each can cover the same distance in complete steps? (in $cm$)

Find the $g.c.d.$ (Greatest Common Divisor) of $75$ and $243$ using Euclid's division algorithm.

The value of $\text{g.c.d.}(18, 24) \times \text{l.c.m.}(18, 24) = \dots$