Show that there are exactly (p^2-p)/2 monic irreducible polynomials of degree 2 over Z_p, where p is any prime.

Using the definition of irreducibility, Theorem: A polynomial of degree 2 or 3 is irreducible over the field F iff it has no roots in F, or Lemma of Theorem: The nonconstant polynomial p(x) an element of F[x] is irreducible over F iff for all f(x), g(x) an element of F[x], p(x)|(f(x)g(x)) implies p(x)|f(x) or p(x)|g(x), or any other known theorems of polynomials except those involving irreducibility.

Using the definition of irreducibility, Theorem: A polynomial of degree 2 or 3 is irreducible over the field F iff it has no roots in F, or Lemma of Theorem: The nonconstant polynomial p(x) an element of F[x] is irreducible over F iff for all f(x), g(x) an element of F[x], p(x)|(f(x)g(x)) implies p(x)|f(x) or p(x)|g(x), or any other known theorems of polynomials except those involving irreducibility.

### Recently Asked Questions

- : Average = arithmetic mean Correlation = linear correlation SD = standard deviation Rms = root-mean-square = Area of a rectangle with adjacent edges a and b =

- To reduce the variability of estimates from a simple random sample , you should _______ 2pts

- Which case (s) scored higher on Y than the model predicted ?