Have fun with GCD & LCM!

The greatest common divisor(GCD) and the lowest commom multiple(LCM) of two whole numbers, \(m\) and \(n\), are \(14\) and \(6468\) respectively. Find the smallest possible value of \(m+n\).

×

Problem Loading...

Note Loading...

Set Loading...