lol_nl
- 40
- 0
Working through A Book of Abstract Algebra, I encountered several exercises on roots of polynomials in Z_{n} I was just wondering whether there exists something like a quadratic equation for polynomials of degree 2. If the solutions of the usual quadratic formula happen to be integers, can one simply take these modulo n to find solutions of the quadratic in Z_{n}? What if they are not integers? Clearly a field extension is needed to find solutions, but how does this precisely work?
As an example, consider the equation x^{2} + x + 1 = 0 in Z_{2}. The quadratic equation gives x = -\frac{1}{2} \pm \frac{1}{2} i. Suppose you name the positive root as c. Then Z_{2}(c) = {0,1,c,1+c} is the field extension. Now can one work with c in the same way as with x = -\frac{1}{2} \pm \frac{1}{2} i? Clearly, you easily get contradictions like 1 = -1 = 2c-1 = 3i = i and so on.
As an example, consider the equation x^{2} + x + 1 = 0 in Z_{2}. The quadratic equation gives x = -\frac{1}{2} \pm \frac{1}{2} i. Suppose you name the positive root as c. Then Z_{2}(c) = {0,1,c,1+c} is the field extension. Now can one work with c in the same way as with x = -\frac{1}{2} \pm \frac{1}{2} i? Clearly, you easily get contradictions like 1 = -1 = 2c-1 = 3i = i and so on.