I understand that we would normally square both sides of an inequality in something like this: $|x|>|y|$, but from Andreescu & Andrica NT: SEP, there is this problem:
(Duke) What is the sum of all integers $n$ such that $n^2+2n+2$ divides $n^3 + 4n^2 + 4n − 14$?
It is solved with simple number theory and the division algorithm, but part of the solution involves this inequality: $|-2n-18| \ge |n^2+2n+2|$. Apparently, the solution range is $-4 \le n \le 4$. We could square both sides, but we would get a higher degree polynomial, and it might take a bit longer to find the solutions, something like $0 \ge n^4 +4n^3 -64n - 320$.
There are other threads like this one: double absolute value that suggest splitting into cases, but I'm not sure how I would do that for this, with the quadratic.
