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

Prove f(x)g(x)(modpx)that if and only if f(x)and g(x)leave the same remainder when divided by p(x) .

Short Answer

Expert verified

It is provedf(x)g(x)(modpx)

Step by step solution

01

Write the theorem

Assume that F is the field,ax,bx,cxbelongs to the field,axdividescx, ifax/bxcxandaxbxare relatively prime.

02

Proof

Assume that qxand rxare quotient and remainder, respectively, when fxis divided by px. Also, q'xand r'xare quotient and remainder when gxis divided by px.

Then, by division algorithm, we have:

fx=qxpx+rxand,gx=q'xpx+r'x

Here, both the remainders being 0 or having a degree less than the degree of px.

ForFxgxmodpxconsiderthedefinitionpx/fx-gx,whichimplies

px/qx-q'xpx+rx-r'x1

But, rx-r'xis either 0 or less than the degree of ; then we have

rx-r'x=0rx=r'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