If $n^2+11$ is a prime number, then is the number $n+4$ a perfect cube?
I think no, but am unable to prove it. By reducing $n^2+11$ modulo $3$ and $10$, and using Fermat's little theorem, I am able to conclude that $n=6k$ or $n=30k$ for some integer $k$. But now, I am unable to proceed further. Any help.
PS: This is problem $S-393$ of Mathematical Reflections.
Look at the contrapositive. If $n+4=k^3$ for some $n,k\in\mathbb Z$, then
$$n^2+11=\left(k^3-4\right)^2+11=$$
$$=\left(k^2 + k + 3\right)\left(k^4 - k^3 - 2 k^2 - 3 k + 9\right)$$
Edit: $n^2+11>k^2+k+3$ because $(k^3-4)^2+11\ge 3k^2+11>k^2+k+3$ because $|k^3-4|\ge 3$, $|k^3-4|\ge k^2$ for all $k\in\mathbb Z$ because if $k\ge 2$, then $k^3\ge 2k^2\ge k^2+4$, if $k\le 0$, then $k^3\le -k^2<-k^2+4$, if $k=1$, then it's true.