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)}$

Amountain climber starts a climb at an elevation of 453 feet above sea level at his first rest stop he has climbed 162 feet and by his second rest stop he has climbed another 207 feet its getting late in the day so the climber starts his way down if the climber desends 285 feet how much does he need to ascend or descend to return to the original starting point