Purchase Solution

Irreducible Palindromic Polynomials, Reducible and Irreducible Polynomials and Degrees of Polynomials

Not what you're looking for?

Ask Custom Question

3.- a) Determine the number of polynomials f(x) of degree 6 over for which f(1)=1 and f(0)=1.

b) Determine the number of polynomials of degree 6 over that are reducible but have no linear factors. How this is possible, please can you explain this?
Hint Consider the possible factorizations.

c) Determine the number of irreducible polynomials of degree 6 over . Explain.
In order to find this, is there a formula o we need to figure out by inspection?

4.- Show that there is an irreducible palindromic polynomial of degree 6 over .
Hint use problem #3

Please see the attached file for the fully formatted problems.

keywords: palindrome

Attachments
Purchase this Solution
Solution Summary

Irreducible Palindromic Polynomials, Reducible and Irreducible Polynomials and Degrees of Polynomials are investigated. The solution is detailed and well presented. The response received a rating of "5/5" from the student who originally posted the question.

Solution Preview

Please see the attached file for the complete solution.
Thanks for using BrainMass.

Problem #3
(a) The polynomial with degree 6 over must have form
, where .
From the condition, we know
, ,
Thus we have , so there are odd number of 1's from to . There are possibilities.
Thus there are 16 polynomials with degree 6 over such that .
(b) Since has no linear factor, then . Because ...

Purchase this Solution
Free BrainMass Quizzes
Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

View More Free Quizzes
Related BrainMass Solutions

  • Irreducible Palindromic Polynomials of Even Degrees

    106157 Irreducible Palindromic Polynomials of Even Degrees Show that if a palindromic polynomial of degree n is irreducible over F, then n must be even.

  • Palindromic Polynomials

    106269 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.

  • Prime Ideals and Irreducible Polynomials

    Next, suppose f(x) and g(x) are reducible, we can express them in the product of irreducible polynomials. That is, f(x)=p_1(x)*...*p_s(x) and g(x)=q_1(x)*...*q_t(x), where p_i(x) and q_j(x) are irreducible polynomials.

  • Irreducible Polynomials

    Factorise those polynomials that are reducible into a product of irreducible factors.

  • Palindromic and Reciprocal Polynomials

    Palindromic and reciprocal polynomials are investigated.

  • Irreducible polynomial problems

    471901 Irreducible polynomial problems Determine the number of monic irreducible polynomials of degree 4 in F_q without using the Moebius Inversion Formula. Let us first calculate the number of reducible monic polynomials of degree 4 over F_q.

  • Irreducible Polynomials

    103918 Solving Irreducible Polynomials Prove that a polynomial f(x) of degree 2 or 3 over a field F is irreducible if and only if f(a) different of 0 for all a belongs F.

  • Irreducible Polynomials

    107076 Irreducible Polynomials Prove that X^2-Y^2-1 is irreducible in Q[X,Y]. Proof: Since X^2-Y^2-1 has degree 2, if it is reducible in Q[X,Y], then its factor can only have degree 1.

  • Irreducible Polynomials

    If F_q is a finite field and 'r' is a 'prime' number, the number of irreducible monic polynomials of degree 'r' is ( q^r - q ) /r . Pf: We use the above theorem. Since r is a prime, the degrees of polynomials can be either 'r' or '1'.

View More Related Solutions