Explore BrainMass

Explore BrainMass

    Irreducible over the rationals.

    Not what you're looking for? Search our solutions OR ask your own Custom question.

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

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

    © BrainMass Inc. brainmass.com March 4, 2021, 7:45 pm ad1c9bdddf
    https://brainmass.com/math/ring-theory/irreducible-over-rationals-120562

    Attachments

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

    $2.49

    ADVERTISEMENT