Share
Explore BrainMass

Palindromic Polynomials

Problem #4
A palindromic polynomial is such that for all . Now we use the result in problem #3 to find an irreducible palindromic polynomial of degree 6 over . First, we compute all reducible ones.

Now we consider the palindromic . From problem #3(c), is irreducible.

I am sorry but I do not understand the definition of palindromic polynomial, can you explain with more details this, please.

Please see the attached file for the fully formatted problem.

Attachments

Solution Summary

Palindromic polynomials are discussed.

$2.19