Written assignments must be typeset. While it is neither necessary
nor desirable to show small details of computation, you must indicate
what you are doing and explain any reasoning used. Accuracy is
important; with 5 problems in an assignment worth 5 points, there will
be no room for partial credit on a problem.
Explain your solutions.
If you are in the writing intensive division of the course, you must complete each written assignment in a satisfactory way. This may require re-submission after an initial evaluation.
Find the order of the congruence class of the polynomial f(x) modulo the polynomial m(x) when the field of coefficents is F_{p} in the following cases:
f(x) = x, m(x) = x^{2} + 1, and p = 5.
f(x) = x, m(x) = x^{2} - x + 1, and p = 5.
f(x) = x - 2, m(x) = x^{2} + 5 x + 1 , and p = 7.
f(x) = x + 1, m(x) = x^{3} - x^{2} + 1, and p = 3.
Find a polynomial f(t) in F_{5}[t] whose congruence class modulo m(t) is a primitive element for the field F_{5}[t]/m(t) F_{5}[t] when m(t) = t^{2} - t + 1.
F_{4} is defined to be the field F_{2}[t]/(t^{2} + t + 1)F_{2}[t].
How many congruence classes are there of polynomials in F_{4}[x] modulo the polynomial x^{3} + x + 1 ?
Find a primitive element for the ring F_{4}[x]/(x^{3} + x + 1)F_{4}[x] of congruence classes.
Explain why the polynomial x^{3} + x + 1 is irreducible over F_{4}.
Let f(t) be a polynomial of degree 5 over F_{2}.
List three irreducible polynomials in F_{2}[t] of degree smaller than 5 having the property that f is irreducible if it is divisible by none of them.
Give an example of a polynomial f of degree 5 that is not divisible by any of the three polynomials you listed for the previous part.
For the polynomial f(t) given in the previous part find a polynomial g(t) in F_{2}[t] of smallest possible degree such that g(t) is primitive in the field F_{2}[t]/f(t)F_{2}[t].
Write a proof of the following proposition: If F is a field and f(t) is in the ring F[t] of polynomials with coefficients in F, then the polynomial t and the polynomial f(t) have no (non-constant) common factor if and only if f(0) <> 0.