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

Show that there are infinitely many integers k such that

x9+12x521x+kis irreducible in [x]

Short Answer

Expert verified

It is proved there are infinitely many integers ksuch that x9+12x521x+k

is irreducible in[x]

Step by step solution

01

Eisenstein’s criterion

According to Eisenstein’s criterion assume that f(x)=anxn++a1x+a0be any non constant polynomial having integer coefficients. The polynomial f(x)is irreducible in [x]if there is a prime

psuch that pdivides the coefficients a0,a1,,an1but it does not divide an andp2

does not dividea0

02

Prove the result

Assume that mbeany integer that is relatively prime to 3. Consider k=3m.Then, we have

3|1, 3|12, 3|(21), 3|kand 32|k

By Eisenstein’s criterion, we can say that x9+12x521x+kis irreducible.

As we know that there are infinitely many integers relatively prime to 3, there are infinitely many integers

ksuch that x9+12x521x+kis irreducible in [x]

Hence, it is proved there are infinitely many integers ksuch thatx9+12x521x+k is irreducible in [x]

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