Purchase Solution

Irreducible over the rationals.

Not what you're looking for?

Ask Custom Question

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

Attachments
Purchase this Solution
Solution Summary

It is the explanation for the following problem:

If P is a prime number, prove that the polynomial x^n - p is irreducible over the rationals.
The solution is given in detail.

Solution Preview

See the attached file for the solution of the problem.

Modern Algebra
Ring Theory (XXXIV)
Polynomials over the Rational Field
Euclidean Ring
...

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.

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.

Probability Quiz

Some questions on probability

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

View More Free Quizzes
Related BrainMass Solutions

  • Proofs with sets

    a) Determine the irreducibility of x20-11 over Q(set of rationals), and use it to prove or disprove that the ideal is a maximal ideal of Q[x].

  • Unique Factorization Domain with Quotient Field

    the fraction field of R = Z[2root2] is F = { a + b(2 root 2) : a, b in Q}, where Q = rationals let p(x) = x^2 - 2; then p factors (uniquely) into a product of two linear factors in F[x] x^2 - 2 = (x - root 2)(x + root 2) but neither of

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

    106154 Irreducible Palindromic Polynomials, Reducible and Irreducible 3.- a) Determine the number of polynomials f(x) of degree 6 over for which f(1)=1 and f(0)=1.

  • Irreducible Polynomials

    Using the definition of irreducibility, Theorem: A polynomial of degree 2 or 3 is irreducible over the field F iff it has no roots in F, or Lemma of Theorem: The nonconstant polynomial p(x) an element of F[x] is irreducible over F iff for all f(x), g(

  • Irreducible Polynomials

    Find, with justification, a polynomial in that is irreducible over but not over . Please see the attached file for the complete solution. 1 Decide, giving your reasons, which of the following polynomials is irreducible over .

  • Probability of Approximating Real Numbers with Rationals

    Please see the attached file. This solution contains over 100 words and calculations to aid you in understanding the probability of approximately real numbers with rationals.

  • Irreducible polynomial problems

    ), where f(x) is an irreducible monic polynomial over F_q of the degree 2, (x-a)f(x), where f(x) is an irreducible monic polynomial over F_q of the degree 3, (x-a)(x-b)f(x), where f(x) is an irreducible monic polynomial over F_q of the degree 2,

  • Polynomial Rings: Irreducible Polynomials

    Hence is irreducible over , the field of integers mod . is irreducible over .

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

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

View More Related Solutions