Purchase Solution

Irreducible polynomial proof

Not what you're looking for?

Ask Custom Question

Prove that X^n-1+X^n-2+........+X+1 is irreducible over Z iff n is prime.

Purchase this Solution
Solution Summary

This provides an example of proving a polynomial is irreducible.

Solution Preview

Please see the attached file.

Prove that is irreducible over Z iff n is prime.

Proof:
Let
For n=2, we have f(x)=x+1, clearly is irreducible.
Now we suppose n>2. Since n given as prime, n must be odd ...

Purchase this Solution
Free BrainMass Quizzes
Probability Quiz

Some questions on probability

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.

Exponential Expressions

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

Solving quadratic inequalities

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

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

View More Free Quizzes
Related BrainMass Solutions

  • Irreducuble Polynomials : Find the Minimum Polynomial and Factorization

    58986 Irreducible Polynomials : Minimum Polynomial and Factorization Find (with proof) an element a Є Q such that Q(√3, √10)= Q(a) . Find the minimum polynomial of √3 + √10 . Hence, or otherwise, show that x^4 -26x^2 + 49 is irreducible over Q.

  • Irreducible Polynomials

    A) how many irreducible polynomial of degree 2 in Z3[x] B) how many irreducible polynomial of degree 3 in Z3[x] There is the following result for which Fermat's little theorem is a special case of. The proof is not reproduced here.

  • Irreducible polynomials

    Show that if K is an extension of F of dimension 7, then f(x) is irreducible in K[x]. a) Proof: Let Irreducible polynomials are exemplified.

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

  • Ireducibility

    This is a proof regarding irreducibility and a polynomial ring.

  • Linear operators

    This implies that is not the minimal polynomial. We get a contradiction. Therefore, there must exist a vector such that . Then we get This is a proof regarding linear operators, vectors, and t-annihilators.

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

    (c) Since is irreducible, then it has no linear factor and thus . The proof is shown in (b). From (a), there are 16 polynomials with degree 6 and . From (b), 6 of them are reducible. So there are 16 - 6 = 10 irreducible polynomials.

  • Irreducible polynomial; algebraic over R

    A detailed proof that the polynomial x^4 - 16*(x^2) + 4 is irreducible in Q[x] is given, as is a detailed proof that every complex number is algebraic over R.

  • Primitive polynomials and irreducible polynomials

    2) How do I prove x^4+x^3+1 is an irreducible polynomial of degree 4 over Z mod?

View More Related Solutions