Purchase Solution

Polynomials over the Rational Field: Monic Polynomial: If a is rational and x - a divides an integer monic polynomial, prove that a must be an integer.

Not what you're looking for?

Ask Custom Question

Modern Algebra
Ring Theory (XXXVII)
Polynomials over the Rational Field
Monic Polynomial
Irreducible Polynomial

If a is rational and x - a divides an integer monic polynomial, prove that a must be an integer.

Attachments
Purchase this Solution
Solution Summary

It explains about the monic polynomials over the rational field. It mainly describes that if a is rational and x - a divides
an integer monic polynomial, then a must be an integer.
The solution is given in detail.

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
Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

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

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

  • Chinese Remainder Theorem

    113607 Chinese Remainder Theorem Need to prove two parts and must follow the Chinese Remainder Theorem. Let be polynomials with integer coefficients of the same degree d.

  • Irreducible Polynomials

    f (x) = ( x + 2 ) ( x 2 + 2 ) 2 ) Since 8 = 23, the prime field is GF(2) and we need to find a monic irreducible cubic polynomial over that field.

  • Irreducible Polynomials

    Pf: We use the above theorem. Since r is a prime, the degrees of polynomials can be either 'r' or '1'. We see that there are exactly 'q' monic irreducible polynomials of degree '1' in F_q( x, x-1, ... x-q-1).

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

  • Finding a Primitive Element of GF(49)

    468489 Monic polynomial Find an irreducible monic polynomial of degree 2 over the field Z_7 whose root is a primitive element GF(49). First we need a way to characterize all monic irreducible polynomials of degree 2 over Z_7.

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

  • Unique Factorization Domain with Quotient Field

    107075 Unique Factorization Domain with Quotient Field Let R be an integral domain with quotient field F and let p (X) be a monic polynomial in R[X] : Assume that p (X) = a (X) b (X) where a (X) and b (X) are monic polynomials in F [X] of smaller degree

  • Coding Theory : Cyclic Codes

    (iii) Let g E lFq[x] be the generator polynomial of a cyclic code C c R. Show that .... is a basis of C, where r is the degree of g and, for f E Fq[xJ, f denotes the residue class of f in R. (iv) Let C and g be as in part (ii).

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

View More Related Solutions