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)}$?
<|im_start|>system
You are a helpful assistant.<|im_end|>
<|im_start|>user
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)}$?
Please reason step by step, and put your final answer within \boxed{{}}.<|im_end|>
<|im_start|>assistant

user
22
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)}$?
train