Purchase Solution

Prove that the polynomial x^2 + x + 1 is irreducible over

Not what you're looking for?

Ask Custom Question

Prove that the polynomial x^2 + x + 1 is irreducible over F , the field of integers modulo 2.

The complete problem is in the attached file.

Attachments
Purchase this Solution
Solution Summary

It proves that the polynomial x^2 + x + 1 is irreducible over F , the field of integers modulo 2.
It also defines the two operations addition modulo 2 and multiplication modulo 2 of the field of
integers F.
The solution is given in detail.

Solution Preview

The solution is in the attached file.

Algebra (II)
By:- Thokchom Sarojkumar Sinha

Prove that the polynomial
is irreducible over F, the field of integers modulo 2.

Solution:- Let

Also let F be the field of integers modulo 2,
then F = { 0,1} where the operations of F are addition modulo 2
and multiplication modulo 2
or,

We have ,
where

Therefore

...

Solution provided by:
Thokchom Sarojkumar Sinha, MSc
Education
  • BSc, Manipur University
  • MSc, Kanpur University
Recent Feedback
  • "Thanks this really helped."
  • "Sorry for the delay, I was unable to be online during the holiday. The post is very helpful."
  • "Very nice thank you"
  • "Thank you a million!!! Would happen to understand any of the other tensor problems i have posted???"
  • "You are awesome. Thank you"
Purchase this Solution
Free BrainMass Quizzes
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.

Solving quadratic inequalities

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

Probability Quiz

Some questions on probability

Exponential Expressions

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

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

View More Free Quizzes
Related BrainMass Solutions

  • Irreducibility Multiple Roots

    Prove has no multiple root over . Prove by contradiction: Suppose f(x) has a multiple root, say x=a, then , where p(x) is a polynomial, and n is the multiplicity of that root.

  • Polynomial Rings: Irreducible Polynomials

    114321 Polynomial Rings: Irreducible Polynomials Prove that x^2 + 1 is irreducible over the field F of integers mod 11 and prove directly that F[x]/(x^2 + 1) is a field having 121 elements.

  • Irreducible polynomial proof

    107077 Irreducible polynomial proof Prove that X^n-1+X^n-2+........+X+1 is irreducible over Z iff n is prime. Please see the attached file. Prove that is irreducible over Z iff n is prime.

  • Irreducible over the rationals.

    120562 Irreducible over the rationals. If P is a prime number, prove that the polynomial x^n - p is irreducible over the rationals.

  • F[x]/(x^2 + 1) is isomorphic to the field of complex numbers

    Prove that F[x]/(x^2 + 1) is a field isomorphic to the field of complex numbers. See the attached file for the solution of the problem.

  • Primitive polynomials and irreducible polynomials

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

  • F[x]/(f(x)) is a field with p^n elements.

    If f(x) is in F[x], where F is the field of integers mod p, p a prime, and f(x) is irreducible over F of degree n, prove that F[x]/(f(x)) is a field with p^n elements.

  • Find Irreducible Polynomial

    11430 Find Irreducible Polynomial Find an irreducible polynomial defining the extension Q(3^1/2, 5^1/2).

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

View More Related Solutions