<s>[INST] $a,b,c$ such that $ax^2+bx+c \equiv 0$ (mod $3$) holds for all $x$? Today I wrote a computer program that finds whole positive $a,b,c$ such that $ax^2+bx+c \equiv 0$ (mod $n$) holds for all $x$. For $n=2$ I get several results, such as $x^2+x$, $3x^2+x$ and more. However, I was not able to find $a,b,c$ for the case $n=3$.

(Why) Are there no $a,b,c$ for $n=3$?

Remark: Of course $\text{gcd}(a,b,c) = 1$ and $a,b,c \in \mathbb{Z}$ and $a \not = 0$ or $b \not = 0$ or $c \not = 0$.
 [/INST] What conditions are needed in order to conclude that the familiar quadratic formula holds, saying that if $ax^2+bx+c=0$ and $a\ne0,$ then $x= \dfrac{-b\pm\sqrt{b^2-4ac}}{2a}\text{ ?}$
One needs $2a$ to have a multiplicative inverse, regardless of which non-zero element $a$ is. Thus if $n=6,$ for example, and $a=3,$ you get $2a=0$ and that has no multiplicative inverse; thus dividing by $2a$ makes no sense.
But when $n=3$ and $a\ne 0$, then either $a=1$ and $2a=2,$ and $2$ is its own multiplicative inverse, or $a=2$ and $2a=1,$ and $1$ is its own multiplicative inverse. Thus the quadratic formula holds, so a quadratic equation cannot have more than two roots.
</s>