Find all natural numbers $n$ such that $2n+1$ divides $n^{4}+n^{2}$.
My attempt:- We need to find natural numbers, $n$, for which $2n+1\mid n^{4}+n^{2}$. We write, $$n^{4}+n^{2}=n^{2}(n^{2}+1)$$. It can be easily proved that $(n^{2},2n+1)=1$(so I think I need not type it here because that will increase the length of this post).This implies that, $$n^{2}+1\equiv 0\pmod {2n+1}\implies 4n^2+4\equiv 0\pmod{2n+1} \implies (2n+1)^{2}+3\equiv 4n\pmod{2n+1} \implies 4n\equiv 3\pmod{2n+1} \implies 2(2n+1)\equiv 5\pmod{2n+1}$$. Hence, $2n+1\mid 5$ and this implies $n=2$, which is the only solution. Does this look good? I think this solution is correct but I'm not satisfied with it, because it took me quite a long time before I came up with this argument. Can this be solved without any such manipulations? Thank you.
Yes, your solution is correct.
You can also avoid modular arithmetic. It is correct that $n^2$ and $2n+1$ are relatively prime so $$2n+1\mid n^2+1$$ Since $2n+1\mid 4n^2-1$ we have $$2n+1\mid 4(n^2+1)-(4n^2-1) =5$$ and you are done.