I want to know a general efficient solution for determining whether there are solutions for $x$ in the equation
$$n^2+9n-2=(n+11)x$$
for $n\le 11$. I tried solving for $n$ as a quadratic equation but didn't really learn anything from that.
$$ n = \frac{9-x\pm \sqrt{(9-x)^2 -4(-2-11x)}}{2} $$
Obviously I could brute-force search all choices of $n$, and did, and found that $n=9$ yields an integer solution. But I feel like I must be missing the point of the problem if I had to brute-force search it.
This occurs in the context of learning the Euclidean algorithm for finding the GCD and some concepts of modular arithmetic. I thought about computing both sides of the equation mod 12, but I don't see anything helpful from that.
I also thought about ways to factor the square, but completing the square either involves getting a fraction or is just equivalent to the quadratic equation, so that doesn't seem productive.