# Find every integer k s.t. k>=3 and k-2 divides 2k

You can use this: let $n,m$ be two different positive integers, $n|m$ iff there is an integer $k\geq 2$ such that $n=km$.
So, with the same hypothesis, $n|m\Rightarrow n\leq \frac{m}{2}$