Efficient algorithm for getting from 1 to n with 3 specific operations
Find the shortest path from $1$ to&nbsp;$n$ on an appropriate graph on vertices $\{1, \dots, n\}$.  This approach will work whenever it's guaranteed that intermediate values in the calculations will lie within some bounded range.