Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Give an example of a polynomial f(x)Z[x]and a prime p such that f(x)is reducible inrole="math" localid="1649243074209" Q[x] but f(x)is irreducible inf(x)Z[x]. Does this contradict Theorem 4.25?

Short Answer

Expert verified

The example is2x4+x2+x+1=x2-x+12x2+2x+1

Step by step solution

01

Write the theorem

According to Theorem 4.25, assume thatfx=akxk++a1x+a0 is a polynomial with integer coefficients, and consider p as a positive prime. It does not divide ak . This implies iffx is irreducible in Zpx, then fxis irreducible inQx .

02

Write the example

Consider.2x4+x2+x+1=x2-x+12x2+2x+1

Rewrite the equation in Z2asfollows:

2x4+x2+x+1=x2+x+1

The obtained polynomial is irreducible. This example does not contradictTheorem4.25becauseone of the assumptions is that the prime does not divide the leading term of the polynomial.

Hence, the example is 2x4+x2+x+1=x2-x+12x2+2x+1 , and in Z2 , we have 2x4+x2+x+1=x2+x+1, that is irreducible.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Study anywhere. Anytime. Across all devices.

Sign-up for free