Tagged: minimal polynomial

Polynomial $x^p-x+a$ is Irreducible and Separable Over a Finite Field

Problem 229

Let $p\in \Z$ be a prime number and let $\F_p$ be the field of $p$ elements.
For any nonzero element $a\in \F_p$, prove that the polynomial
\[f(x)=x^p-x+a\] is irreducible and separable over $F_p$.

(Dummit and Foote “Abstract Algebra” Section 13.5 Exercise #5 on p.551)

 
Read solution

LoadingAdd to solve later

Finite Order Matrix and its Trace

Problem 28

Let $A$ be an $n\times n$ matrix and suppose that $A^r=I_n$ for some positive integer $r$. Then show that

(a) $|\tr(A)|\leq n$.

(b) If $|\tr(A)|=n$, then $A=\zeta I_n$ for an $r$-th root of unity $\zeta$.

(c) $\tr(A)=n$ if and only if $A=I_n$.

Read solution

LoadingAdd to solve later