elementary number theory - Minimize LCM / GCD

If $n$ and $k$ are positive integers such that $5<\frac nk<6$, then what is the smallest possible value of $\frac{\mathop{\text{lcm}}[n,k]}{\gcd(n,k)}$?

I am really not sure where to start. I know that in order to create the minimum value, $n$ and $k$ should share a common factor. However, I keep plugging in numbers to no avail. Help is greatly appreciated.

Answer

First of all all fractions can be put into lowest terms.

Second of all If $\frac nk = \frac ab$ and $\gcd(n,k) = d$ and $gcd(a,b) = e$ and $a = a'e; b= b'e;n=n'd; k= k'd$, then $\frac ab =\frac nk \implies \frac {a'e}{b'e}=\frac{n'd}{k'd}\implies\frac {a'}{b'} = \frac {n'}{k'}$ and both are in lowest terms. So $a' = n'$ and $b' = k'$.

Third of all. $\frac{\mathop{\text{lcm}}[n,k]}{\gcd(n,k)} = \frac {n'k'd}{d} = {n'k'}$ and $\frac{\mathop{\text{lcm}}[a,b]}{\gcd(a,b)} = \frac {a'b'e}{e} = a'b' = {n'k'}$.

So we might as well assume $\frac nk$ is in lowest terms.

So we have $5 < \frac nk < 6$ and $n,k$ is in lowest terms and we want to find the least possible value of $nk$.

$5 < \frac nk < 6$

$5k < n < 6k$.

So $kn > k*(5k) = 5k^2$.

As there is no possible $n$ so that $5 < \frac n1 < 6$, the smallest possible value of $k$ is $2$ and if $5 < \frac n2 < 6$ we must have $n =11$. That is one possible solution.

In that case $nk = 11*2 = 22$. (And notice: $22 > 5*2^2$). Is that the smallest possible value?

If $k \ge 3$ we will have $kn >5k^2 \ge 5*3^2 =45 > 22$.

So, yes, $22$ is the smallest possible value.