Instructions: You may type up or handwrite your work, but it must be neat, professional, and organized and it must be saved as a PDF file and uploaded to the appropriate Gradescope assignment. Use a scanner or scanning app to convert handwritten work on paper to PDF. I encourage you to type your work using the provided template.
All tasks below must have a complete solution that represents a good-faith attempt at being right to receive engagement credits. If your submission is complete and turned in on time, you will receive full engagement credit for the assignment. All other submissions will receive zero engagement credit. Read the guidelines at Grading Specifications carefully.
To abide by the class academic honesty policy, your work should represent your own understanding in your own words. If you work with other students, you must clearly indicate who you worked with in your submission. The same is true for using tools like generative AI although I strongly discourage you from using such tools since you need to build your own understanding here to do well on exams.
For these problems a justification is not required for credit, but it may be useful for your own understanding to include one. True/False problems should be marked True if the statement is always true, and False otherwise. Multiple choice problems may have more than one correct answer if that is indicated in the problem statement; be sure to select all that apply. Fill-in problems require a short answer such as a number, word, or phrase.
True/False: The coefficients of the minimal polynomial with respect to \(F\) of \(\alpha\) a nonzero element of an extension field \(E\) of \(F\) are elements of \(F\text{.}\)
True/False: The factors of \(Q(x)=x^{q^n}-x\) in \(F[x]\) with \(|F|=q\) are exactly the monic irreducible polynomials in \(F[x]\) with degree dividing \(n\) and these are the same as the minimal polynomials of the elements of \(E\) the field of roots of \(Q\) over \(F\text{.}\)
In this problem you will investigate the structure of a field \(K\) of order \(2^6\) with primitive element \(\beta\text{.}\) It may be useful to recall that the irreducible polynomials of degree 4 or lower over \(\F_2\) are
Identify the minimal polynomials which are factors of \(x^4-x\) and corresponding elements (as powers of \(\beta\)) that comprise the subfield of size \(4\) in \(K\text{.}\)
Identify the minimal polynomials which are factors of \(x^8-x\) and corresponding elements (as powers of \(\beta\)) that comprise the subfield of size \(8\) in \(K\text{.}\)
Based on your work above, how many elements of \(K\) have minimal polynomials of degree \(6\text{?}\) What does this tell you about the number of monic irreducible polynomials of degree \(6\) over \(\GF(2)\text{?}\)
Let \(K\) be the field \(\GF(2^3)\) and let \(\beta\) be an element of multiplicative order 9 in the extension field \(E\) of \(K\) with extension degree \([E:K]=2\text{.}\)
Identify the minimal polynomials \(M_{\beta^i}(x)\) (with respect to \(K\)) whose coefficients are in \(\GF(2)\) and explicitly give their coefficients.