To begin with, we transform 8n+n into the following expression:
8n+n=(2n)3+n=(2n+n)((2n)2−n⋅2n+n2)−(n3−n).
Since (2n)2−n⋅2n+n2 is an integer, from the expression above it follows that the statement 8n+n is divisible by 2n+n is equivalent to the statement n3−n is divisible by 2n+n.
If n=1, then n3−n=0, so 8n+n is divisible by 2n+n in this case. If n≥2, n3−n>0, so we must have n3−n≥2n+n; in particular, it is necessary that n3>2n. Let us, therefore, set f(n)=2nn3. Then, if n≥4 we have
f(n)f(n+1)=21⋅(nn+1)3=21⋅(1+n1)3≤21⋅(1+41)3=128125<1.
Therefore, we get f(4)>f(5)>…. Since f(10)=10241000<1, we see that if n≥10, then f(n)<1, i.e., n3<2n.
Thus, we see that it is enough to check that for which n satisfying 2≤n<10, n3−n is divisible by 2n+n. For, n=2,3,4,5,6,7,8,9 we get
(n3−n,2n+n)=(6,6),(24,11),(60,20),(120,37),(210,70)(336,135),(504,264),(720,521),
and we conclude that n3−n is divisible by 2n+n, when n=2,4,6. Together with n=1, we get that the desired solution is n=1,2,4,6.