Is Every Rootless Polynomial Over a Finite Field Prime?

  • Context: Graduate 
  • Thread starter Thread starter wxrebecca
  • Start date Start date
  • Tags Tags
    Polynomials Proofs
Click For Summary
SUMMARY

This discussion centers on the characterization of rootless polynomials over finite fields, specifically addressing polynomials of degree 2 and 3. It establishes that such polynomials are prime if they lack roots in the field F. Additionally, the conversation raises the challenge of identifying a degree 4 polynomial over a finite field that has no roots but is not prime. The discussion also touches on the concept that each polynomial in F[x] corresponds to a unique polynomial function from F to F, emphasizing the distinctness of these functions within finite fields.

PREREQUISITES
  • Understanding of polynomial functions in finite fields
  • Knowledge of prime polynomials and their properties
  • Familiarity with polynomial factorization concepts
  • Basic concepts of finite fields and their structure
NEXT STEPS
  • Research the properties of prime polynomials over finite fields
  • Explore examples of non-prime polynomials of degree 4 over finite fields
  • Study the implications of polynomial functions in F[x] and their uniqueness
  • Learn about the factorization of polynomials in finite fields
USEFUL FOR

Mathematicians, algebraists, and students studying polynomial theory, particularly those focused on finite fields and polynomial factorization.

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.
 

Similar threads

Undergrad How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?
  • · Replies 48 ·
2
Replies
48
Views
6K
Undergrad Equivalent definitons for primitive polynomials
  • · Replies 24 ·
Replies
24
Views
2K
Undergrad Looking for a creative or quick method for finding roots in GF(p^n)
  • · Replies 3 ·
Replies
3
Views
2K
Undergrad Finite fields, irreducible polynomial and minimal polynomial theorem
  • · Replies 6 ·
Replies
6
Views
3K
MHB The irreducible polynomial is not separable
  • · Replies 1 ·
Replies
1
Views
3K
Undergrad Splitting Fields and Separable Polynomials ....
  • · Replies 6 ·
Replies
6
Views
5K
Undergrad Splitting Fields: Anderson and Feil, Theorem 45.5 ....
  • · Replies 9 ·
Replies
9
Views
2K
Undergrad Separable Polynomials - Paul E Bland's definition and exampl
  • · Replies 8 ·
Replies
8
Views
4K
MHB The extension is Galois iff E is a splitting field of a separable polynomial of F[x]
  • · Replies 1 ·
Replies
1
Views
3K
Undergrad Proving the Existence of Roots in Complex Polynomials
  • · Replies 43 ·
2
Replies
43
Views
7K