Is Every Rootless Polynomial Over a Finite Field Prime?

  • Thread starter Thread starter wxrebecca
  • Start date Start date
  • Tags Tags
    Polynomials Proofs
wxrebecca
Messages
5
Reaction score
0
How to prove that a polynomial of degree 2 or 3 over a filed F is a prime polynomial if and only if the polynomial does not have a root in F?

and i can't think of an example of polynomial of degree 4 over a field F that has no root in F but is not a prime polynomial.

it says each polynomial f(x) in F[x] determines a function from F to F by the rule c--> f(c). such a function is called a polynomial function from F to F. how to prove the different polynomials determine different functions when F is an finite field?


thanks for the help

Rebecca
 
Physics news on Phys.org
the most basic result on roots of polynomials says that r is a root if and only if (x-r) is a factor.
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

I How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?
Replies
48
Views
3K
I Equivalent definitons for primitive polynomials
Replies
24
Views
360
I Quintic Polynomial Tschirnhaus Transform: Possible complex Bring Radicals
Replies
0
Views
2K
I Looking for a creative or quick method for finding roots in GF(p^n)
Replies
3
Views
1K
I Finite fields, irreducible polynomial and minimal polynomial theorem
Replies
6
Views
3K
MHB The irreducible polynomial is not separable
Replies
1
Views
2K
I Splitting Fields and Separable Polynomials ....
Replies
6
Views
4K
I Want to understand how to express the derivative as a matrix
Replies
8
Views
2K
I Splitting Fields: Anderson and Feil, Theorem 45.5 ....
Replies
9
Views
2K
I Separable Polynomials - Paul E Bland's definition and exampl
Replies
8
Views
3K

Hot Threads

Recent Insights

Back
Top