Purchase Solution

# Irreducible over the rationals.

Not what you're looking for?

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

##### 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:
###### 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"

##### Free BrainMass Quizzes

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.